Related papers: A note on skew spectrum of graphs
For a graph $G=(V,E),$ a matching $M$ is a set of independent edges. The topic of matchings is well studied in graph theory. In this paper many varieties of matchings are discussed.
Graph polynomials are polynomials assigned to graphs. Interestingly, they also arise in many areas outside graph theory as well. Many properties of graph polynomials have been widely studied. In this paper, we survey some results on the…
In this paper we propose a graph superalgebra which is the supersymmetric analogue of Leavitt path algebras. We find a basis for these superalgebras and characterize when they have polynomial growth.
We establish an Expander Mixing Lemma for directed graphs in terms of the eigenvalues of an associated asymmetric transition probability matrix, extending the classical spectral inequality to the asymmetric setting. As an application, we…
Signed graphs are graphs whose edges get a sign $+1$ or $-1$ (the signature). Signed graphs can be studied by means of graph matrices extended to signed graphs in a natural way. Recently, the spectra of signed graphs have attracted much…
The structural properties of graphs are usually characterized in terms of invariants, which are functions of graphs that do not depend on the labeling of the nodes. In this paper we study convex graph invariants, which are graph invariants…
We determine all graphs for which the adjacency matrix has at most two eigenvalues (multiplicities included) not equal to $-2$, or $0$, and determine which of these graphs are determined by their adjacency spectrum.
The spectrum of a graph $G$ is the set of the eigenvalues of its adjacency matrix. It turns out that one can say a lot about a graph with the only knowledge being the spectrum of this graph. In this paper we obtain new results about the…
As it is well known, the spectrum $ {\rm sp\,} \Gamma$ (of the adjacency matrix $A$) of a graph $\Gamma$, with $d$ distinct eigenvalues other than its spectral radius $\lambda_0$, usually provides a lot of information about the structure of…
Graph polynomials are deemed useful if they give rise to algebraic characterizations of various graph properties, and their evaluations encode many other graph invariants. Algebraic: The complete graphs $K_n$ and the complete bipartite…
We study limits of convergent sequences of string graphs, that is, graphs with an intersection representation consisting of curves in the plane. We use these results to study the limiting behavior of a sequence of random string graphs. We…
The study of spectral graph determination is a fascinating area of research in spectral graph theory and algebraic combinatorics. This field focuses on examining the spectral characterization of various classes of graphs, developing methods…
Two graphs are co-spectral if their respective adjacency matrices have the same multi-set of eigenvalues. A graph is said to be determined by its spectrum if all graphs that are co-spectral with it are isomorphic to it. We consider these…
We give characterizations of the skein polynomial for links (as well as Jones and Alexander-Conway polynomials derivable from it), avoiding the usual "smoothing of a crossing" move. As by-products we have characterizations of these…
This is a survey article for "Handbook of Linear Algebra", 2nd ed., Chapman & Hall/CRC, 2014. An informal introduction to representations of quivers and finite dimensional algebras from a linear algebraist's point of view is given. The…
We study some spectral properties of a matrix that is constructed as a combination of a Laplacian and an adjacency matrix of simple graphs. The matrix considered depends on a positive parameter, as such we consider the implications in…
In the theory of line graphs of undirected graphs there exists an important theorem linking the incidence matrix of the root graph to the adjacency matrix of its line graph. For directed or mixed graphs, however, the exists no analogous…
We relate the graph isomorphism problem to the solvability of certain systems of linear equations with nonnegative variables. This version replaces the two previous versions of this paper.
In this paper, we introduce a new concept namely degree polynomial for vertices of a simple graph. This notion leads to a concept namely degree polynomial sequence which is stronger than the concept of degree sequence. After obtaining the…
Given a digraph D, the complementarity spectrum of the digraph is defined as the set of complementarity eigenvalues of its adjacency matrix. This complementarity spectrum has been shown to be useful in several fields, particularly in…