【摘 要】
：
In [H.Abdo,S.Brandt,D.Dimitrov,The total irregularity of a graph,Discrete Math.Theor.Comput.Sci.16(2014),201-206],Abdo and Dimitov defined the total irregul
【机 构】
：
SchoolofMathematicalSciences,SouthChinaNormalUniversity,Guangzhou,510631,P.R.China
【出 处】
：
The 12th Meeting of the International Academy of Mathematica
论文部分内容阅读
In [H.Abdo,S.Brandt,D.Dimitrov,The total irregularity of a graph,Discrete Math.Theor.Comput.Sci.16(2014),201-206],Abdo and Dimitov defined the total irregularity of a graph G=(V,E)as(irrt(G)=1/2Σu,v∈V|dG(u)-dG(v)|),where dG(u)denotes the vertex degree of a vertex u ∈ V.In this talk,we introduce some results and research progress on the total irregularity of graphs.
其他文献
Let G be a simple undirected graph and Gσ be the corresponding oriented graph of G with the orientation σ.The skew energy of Gσ,denoted by εs(Gσ),is de
The energy ε(G)of a simple graph G is the sum of absolute values of the eigenvalues of its adjacency matrix.The energy of line graph,the Laplacian energy a
We discuss the posterity of AutoGraphiX conjectures,i.e.,new concepts and new conjectures on chemical indices and proofs thereof since the first paper in th
We consider three measures of stability for benzenoids(or graphene patches): the number of Kekule structures(K),the Fries number(F),and the Clar number(C).M
The energy of a graph is the sum of the absolute values of its eigenvalues.We propose a new problem on graph energy change due to any single edge deletion.T
Intrinsic metrics on a graph G have become of interest.Amongst these metrics are the common shortest-path metric,and also the "resistance distance",for whic
Let G be a graph with edge set E(G)that admits a perfect matching M.A forcing set of M is a subset of M contained in no other perfect matchings of G.A compl