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

DOI10.1080/03081087.2013.825959MaRDI QIDQ2929475zbMATH OpenOpenAlexFDO

Authors Alexander Farrugia, Irene Sciriha

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

main eigenvaluesself-complementary graphsmain characteristic polynomialwalks of graphs

Mathematics Subject Classification ID

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

Recommendations

• Graphs with \(n - 1\) main eigenvalues
• Some results on graph spectra
• scientific article; zbMATH DE number 2116377
• The structure of degree-sequences of self-complementary graphs
• On self-complementary strongly regular graphs

Cites work

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

Cited in

(3)

• Balanced centrality of networks
• On the walks on Cayley graphs
• On strongly asymmetric and controllable primitive graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2929475)