【摘 要】
：
Let(G,w)be a weighted graph with a weight function w : E(G)→ R{0}.Its adjacency matrix A is defined as aij=w(ij)the weight of the edge ij∈E(G).A weighted
【机 构】
：
MiddleTennesseeStateUniversity,USA
【出 处】
：
The 12th Meeting of the International Academy of Mathematica
论文部分内容阅读
Let(G,w)be a weighted graph with a weight function w : E(G)→ R\{0}.Its adjacency matrix A is defined as aij=w(ij)the weight of the edge ij∈E(G).A weighted graph(G,w)is invertible if A is invertible.The inverse of(G,w)is another weighted graph with adjacency matrix A-1.In this talk,we will discuss graph inverse and its applications in bounding median eigenvalues which have physical meanings in quantum chemistry,and its connections to other combinatorial topics.
其他文献
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
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
The eccentricity εG(v)of a vertex v in a graph G is the maximum distance from v to other vertices in G.As a fundamental concept in pure graph theory,the ec
The Szeged index of a connected graph G is defined as(Sz(G)=Σe=uv∈E(G)nu(e|G)nv(e|G)),where E(G)is the edge set of G,and for any e = uv ∈ E(G),nu(e|G)is
In this talk,we shall survey some results on iterated line graphs,including hamiltonian cycles,2-factors and even factors with a bounded number components,s