Spectral Graph Theory and the Inverse Eigenvalue Problem of a Graph

A special issue of Mathematics (ISSN 2227-7390). This special issue belongs to the section "Algebra, Geometry and Topology".

Deadline for manuscript submissions: 31 January 2025 | Viewed by 1311

Special Issue Editors


E-Mail Website
Guest Editor
Department of Mathematics and Statistics, University of Regina, Regina, SK S4S0A2, Canada
Interests: linear algebra; matrix theory; combinatorics

E-Mail Website
Guest Editor
Department of Mathematics and Statistics, University of Regina, Regina, SK S4S0A2, Canada
Interests: algebraic and spectral graph theory; discrete mathematics; matrix theory

E-Mail Website
Guest Editor
Faculty of Science, Department of Mathematics, University of Manitoba, Winnipeg, MB R3T 5V6, Canada
Interests: matrix theory; graph theory; combinatorics; linear algebra

Special Issue Information

Dear Colleagues,

Spectral Graph Theory is the study of the spectra of certain matrices defined from a given graph, including the adjacency matrix, the Laplacian matrix, and other related matrices. Graph spectra have been studied extensively for more than fifty years. The Inverse Eigenvalue Problem of a Graph seeks to determine information about the possible spectra of the real symmetric matrices whose pattern of nonzero entries is described by a given graph.

The special issue of "Spectral Graph Theory and the Inverse Eigenvalue Problem of a Graph" is devoted to a variety of topics in spectral graph theory and the inverse eigenvalue problem of a graph, including but not limited to studying the eigenvalues and eigenvectors of certain graph matrices, minimum rank, maximum nullity and the minimum number of distinct eigenvalues of a graph and their applications. The main aim of this Special Issue is to encourage new theoretical results in spectral graph theory, and the inverse eigenvalue problem of a graph as well as the interaction of spectral graph theory and the inverse eigenvalue problem of a graph with other mathematical sciences.

Prof. Dr. Shaun Fallat
Dr. Seyed Ahmad Mojallal
Dr. Mahsa N. Shirazi
Guest Editors

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Mathematics is an international peer-reviewed open access semimonthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 2600 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Keywords

  • spectral graph theory
  • graph matrices
  • adjacency matrix
  • Laplacian matrix
  • graph eigenvalues
  • graph eigenvectors
  • inverse eigenvalue problem of a graph
  • maximum nullity
  • minimum rank

Published Papers (1 paper)

Order results
Result details
Select all
Export citation of selected articles as:

Research

26 pages, 602 KiB  
Article
Spectral Applications of Vertex-Clique Incidence Matrices Associated with a Graph
by Shaun Fallat and Seyed Ahmad Mojallal
Mathematics 2023, 11(16), 3595; https://0-doi-org.brum.beds.ac.uk/10.3390/math11163595 - 19 Aug 2023
Viewed by 749
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 [...] Read more.
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. Full article
(This article belongs to the Special Issue Spectral Graph Theory and the Inverse Eigenvalue Problem of a Graph)
Show Figures

Figure 1

Back to TopTop