Spectral Applications of Vertex-Clique Incidence Matrices Associated with a Graph

Shaun Fallat and Seyed Ahmad Mojallal ()
Additional contact information
Shaun Fallat: Department of Mathematics and Statistics, University of Regina, Regina, SK S4S 0A2, Canada
Seyed Ahmad Mojallal: Department of Mathematics and Statistics, University of Regina, Regina, SK S4S 0A2, Canada

Mathematics, 2023, vol. 11, issue 16, 1-26

Abstract: Using the notions of clique partitions and edge clique covers of graphs, we consider the corresponding incidence structures. This connection furnishes lower bounds on the negative eigenvalues and their multiplicities associated with the adjacency matrix, bounds on the incidence energy, and on the signless Laplacian energy for graphs. For the more general and well-studied set S ( G ) of all real symmetric matrices associated with a graph G , we apply an extended version of an incidence matrix tied to an edge clique cover to establish several classes of graphs that allow two distinct eigenvalues.

Keywords: clique partition; edge clique cover; vertex-clique incidence matrix; eigenvalues of graphs; graph energy; minimum number of distinct eigenvalues (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2023
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/11/16/3595/pdf (application/pdf)
https://www.mdpi.com/2227-7390/11/16/3595/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:11:y:2023:i:16:p:3595-:d:1220661

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().