A method for constructing graphs with the same resistance spectrum
From MaRDI portal
Publication:6646406
DOI10.1016/j.disc.2024.114284MaRDI QIDQ6646406
Xiang-Feng Pan, Huan Zhou, Si-Ao Xu
Publication date: 2 December 2024
Published in: Discrete Mathematics (Search for Journal in Brave)
Combinatorial aspects of partitions of integers (05A17) Elementary theory of partitions (11P81) Distance in graphs (05C12)
Cites Work
- Unnamed Item
- Unnamed Item
- On the resistance diameters of graphs and their line graphs
- Minimal hexagonal chains with respect to the Kirchhoff index
- Asymptotic formulae in combinatory analysis.
- On sum of powers of normalized Laplacian eigenvalues and resistance distances of graphs
- Computation of resistance distance with Kirchhoff index of body centered cubic structure
- Solution to a conjecture on resistance diameter of lexicographic product of paths
- Computation of the resistance distance and the Kirchhoff index for the two types of claw-free cubic graphs
- Resistance distances in directed graphs: definitions, properties, and applications
This page was built for publication: A method for constructing graphs with the same resistance spectrum
