Adjacency Spectra of Semigraphs

DOI10.1142/S1793830923500118MaRDI QIDQ6397997OpenAlexFDO

Authors Pralhad M. Shinde

Publication date 2 May 2022

Full work available at URL https://doi.org/10.1142/s1793830923500118

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)

Abstract: In this paper, we define the adjacency matrix of a semigraph. We give the conditions for a matrix to be semigraphical and give an algorithm to construct a semigraph from the semigraphical matrices. We derive lower and upper bounds for largest eigenvalues. We study the eigenvalues of adjacency matrix of two types of star semigraphs.

Recommendations

• Adjacency matrix of a semigraph
• Adjacency matrices of semigraphs and their spectral analysis
• Weighted adjacency matrix of a semigraph and its spectral analysis
• Matrix representation of semigraphs
• scientific article; zbMATH DE number 7324138

This page was built for publication: Adjacency Spectra of Semigraphs

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