论文部分内容阅读
In this talk,we present our results on forcing numbers of graphs and some recent developments in forcing numbers of graphs.
Some results on forcing numbers of graphs
【摘 要】
：
In this talk,we present our results on forcing numbers of graphs and some recent developments in forcing numbers of graphs.
【机 构】
：
XinjiangNormalUniversity,China
【出 处】
：
The 12th Meeting of the International Academy of Mathematica
【发表日期】
：
2016年7期
其他文献
With the completion of the sequencing of the genomes of human and other species,the field of analysis of genomic sequences is becoming very important tasks
会议
The eccentric distance sum(EDS)of a connected graph G is defined as ξd(G)=Σv∈VG(εG(u)+εG(v))dG(u,v),where εG(·)is the eccentricity of the correspondi
会议
In this research,we investigate Randic Connectivity Indices(RCI)and energy matrices of certaincycle based graphs.Explicit formulas for the RCI values are gi
会议
We investigate trees with maximum degree at least 3.Among them,the ones that admit maximum Randic Connectivity Index(RCI)Value are identified.We further app
会议