The main eigenvalues and number of walks in self-complementary graphs

DOI10.1080/03081087.2013.825959zbMath1303.05112OpenAlexW1985546925MaRDI QIDQ2929475

Irene Sciriha, Alexander Farrugia

Publication date: 12 November 2014

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03081087.2013.825959

zbMATH Keywords

self-complementary graphsmain eigenvaluesmain characteristic polynomialwalks of graphs

Mathematics Subject Classification ID

Graph polynomials (05C31) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12) Random walks on graphs (05C81)

Related Items (3)

On strongly asymmetric and controllable primitive graphs ⋮ Balanced centrality of networks ⋮ ON THE WALKS ON CAYLEY GRAPHS

Cites Work

• The spectral approach to determining the number of walks in a graph
• The walk partition and colorations of a graph
• Some results on graph spectra
• Selbstkomplementäre Graphen

This page was built for publication: The main eigenvalues and number of walks in self-complementary graphs