Home > Papers

 
 
On the Connectivity of Strong Product of Graphs
LV Min * #
School of Computer Science and Technology, University of Science and Technology of China, Hefei, Anhui,230027
*Correspondence author
#Submitted by
Subject:
Funding: Anhui Provincial Natural Science Foundation(No.No.11040606Q51) and Specialized Research Fund for the Doctoral Program of Higher Educatio)
Opened online: 9 January 2014
Accepted by: none
Citation: LV Min.On the Connectivity of Strong Product of Graphs[OL]. [ 9 January 2014] http://en.paper.edu.cn/en_releasepaper/content/4580133
 
 
For a connected graph G, connectivity is the minimum cardinality of an vertex-cut S in G such that G-S is disconnected or trivial(a graph is trivial if it contains only one vertex). This paper deals with the connectivity of strong product graphs and gives the lower bound for it.
Keywords:Networks; strong Product graph; connectivity
 
 
 

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 129
Bookmarked 0
Recommend 5
Comments Array
Submit your papers