Resistance Distances and Kirchhoff Indices Under Graph Operations
نویسندگان
چکیده
منابع مشابه
Comparison theorems on resistance distances and Kirchhoff indices of S, T-isomers
Comparison theorems on resistance distances and Kirchhoff indices of the so-called S& T -isomer graphs are established. Then these results are applied to compare Kirchhoff indices of hexagonal chains, showing that the straight chain is the unique chain with maximum Kirchhoff index, whereas the minimum Kirchhoff index is achieved only when the hexagonal chain is an ‘‘all-kink’’ chain. © 2014 Els...
متن کاملResistance distances and the Kirchhoff index in Cayley graphs
In most cases authors are permitted to post their version of the article (e.g. in Word or Tex form) to their personal website or institutional repository. Authors requiring further information regarding Elsevier's archiving and manuscript policies are encouraged to visit: a b s t r a c t In this paper, closed-form formulae for the Kirchhoff index and resistance distances of the Cayley graphs ov...
متن کاملCharacteristics of Common Neighborhood Graph under Graph Operations and on Cayley Graphs
Let G(V;E) be a graph. The common neighborhood graph (congraph) of G is a graph with vertex set V , in which two vertices are adjacent if and only if they have a common neighbor in G. In this paper, we obtain characteristics of congraphs under graph operations; Graph :::::union:::::, Graph cartesian product, Graph tensor product, and Graph join, and relations between Cayley graphs and its c...
متن کاملWeighted Szeged Indices of Some Graph Operations
In this paper, the weighted Szeged indices of Cartesian product and Corona product of two connected graphs are obtained. Using the results obtained here, the weighted Szeged indices of the hypercube of dimension n, Hamming graph, C4 nanotubes, nanotorus, grid, t−fold bristled, sunlet, fan, wheel, bottleneck graphs and some classes of bridge graphs are computed.
متن کاملDistances between graphs under edge operations
We investigate three metrics on the isomorphism classes of graphs derived from elementary edge operations: the edge move, rotation and slide distances. We derive relations between the metrics, and bounds on the distance between arbitrary graphs and between arbitrary trees. We also consider the sensitivity of the metrics to various graph operations. Correspondence to: Wayne Goddard Dept of Compu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2020
ISSN: 2169-3536
DOI: 10.1109/access.2020.2995935