Home > Papers

 
 
Nodal domain count and vertex bipartiteness
LUO Zuo-juan, ZHOU Bo
*Correspondence author
#Submitted by
Subject:
Funding: Specialized Research Fund for the Doctoral Program of HigherEducation of China (No.20124407110002)
Opened online: 4 December 2015
Accepted by: none
Citation: LUO Zuo-juan, ZHOU Bo.Nodal domain count and vertex bipartiteness[OL]. [ 4 December 2015] http://en.paper.edu.cn/en_releasepaper/content/4666784
 
 
We establish a novel relation between the nodal domain count and the vertex bipartiteness of a graph, give upper and/or lower bound for the nodal domain count of a graph in terms ofthe independent number, and the diameter, and the chromatic number, and characterize the (connected) graphs $G$ withnodal domain count $4$.
Keywords:nodal domain count, vertex bipartiteness, independent number, diameter, chromatic number
 
 
 

For this paper

  • PDF (0B)
  • ● Revision 0   
  • ● Print this paper
  • ● Recommend this paper to a friend
  • ● Add to my favorite list

    Saved Papers

    Please enter a name for this paper to be shown in your personalized Saved Papers list

Tags

Add yours

Related Papers

Statistics

PDF Downloaded 62
Bookmarked 0
Recommend 0
Comments Array
Submit your papers