Related papers: Eccentricity spectral properties of $\mathcal{C}$-…

An eigenvalue of the adjacency matrix of a graph is said to be \emph{main} if the all-1 vector is not orthogonal to the associated eigenspace. In this work, we approach the main eigenvalues of some graphs. The graphs with exactly two main…

Let $G$ be a connected finite graph with vertex set $V(G)$. The eccentricity $e(v)$ of a vertex $v$ is the distance from $v$ to a vertex farthest from $v$. The average eccentricity of $G$ is defined as $\frac{1}{|V(G)|}\sum_{v \in…

Let $G$ be a graph on $n$ nodes with algebraic connectivity $\lambda_{2}$. The eccentricity of a node is defined as the length of a longest shortest path starting at that node. If $s_\ell$ denotes the number of nodes of eccentricity at most…

Let $D$ be an oriented graph with skew adjacency matrix $S(D)$. Two oriented graphs $D$ and $C$ are said to share the same generalized skew spectrum if $S(D)$ and $S(C)$ have the same eigenvalues, and $J-S(D)$ and $J-S(C)$ also have the…

We study representations of graphs by contacts of circular arcs, CCA-representations for short, where the vertices are interior-disjoint circular arcs in the plane and each edge is realized by an endpoint of one arc touching the interior of…

In this paper we study the complementarity spectrum of digraphs, with special attention to the problem of digraph characterization through this complementarity spectrum. That is, whether two non-isomorphic digraphs with the same number of…

The co-maximal subgroup graph $\Gamma(G)$ of a group $G$ is a graph whose vertices are non-trivial proper subgroups of $G$ and two vertices $H$ and $K$ are adjacent if $HK=G$. In this paper, we continue the study of $\Gamma(G)$, especially…

In this paper we completely characterize the graphs which have an edge weighted adjacency matrix belonging to the class of $n \times n$ involutions with spectrum equal to $\{ \lambda_1^{n-2}, \lambda_2^{2} \}$ for some $\lambda_1$ and some…

Let $C^*(E)$ be the graph $C^*$-algebra associated to a graph E and let J be a gauge invariant ideal in $C^*(E)$. We compute the cyclic six-term exact sequence in $K$-theory of the associated extension in terms of the adjacency matrix…

This paper establishes an upper bound on the number of generalized cospectral mates of simple graphs, where the generalized spectrum consists of the spectrum of a graph and its complement. Moving beyond the classical problem of identifying…

All graphs considered are simple and undirected. The Inverse Eigenvalue Problem of a Graph $G$ (IEP-G) aims to find all possible spectra for matrices whose $(i,j)-$entry, for $i\neq j$, is nonzero precisely when $i$ is adjacent to $j$. A…

Complement-reducible graphs (or cographs) are the graphs formed from the single-vertex graph by the operations of complement and disjoint union. By combining the Johnson-Newman theorem on generalized cospectrality with the standard tools in…

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…

An invariant for cospectral graphs is a property shared by all cospectral graphs. In this paper, we establish three novel arithmetic invariants for cospectral graphs, revealing deep connections between spectral properties and combinatorial…

The eccentricity matrix $E(G)$ of a simple connected graph $G$ is obtained from the distance matrix $D(G)$ of $G$ by retaining the largest distance in each row and column, and by defining the remaining entries to be zero. This paper focuses…

We study regular graphs whose distance-$2$ graph or distance-$1$-or-$2$ graph is strongly regular. We provide a characterization of such graphs $\Gamma$ (among regular graphs with few distinct eigenvalues) in terms of the spectrum and the…

We study graphs on $n$ vertices which have $2n-2$ edges and no proper induced subgraphs of minimum degree $3$. Erd\H{o}s, Faudree, Gy\'arf\'as, and Schelp conjectured that such graphs always have cycles of lengths $3,4,5,\dots, C(n)$ for…

For an arbitrary countable directed graph E we show that the only possible values of the stable rank of the associated Cuntz-Krieger algebra C*(E) are 1, 2 or \infty. Explicit criteria for each of these three cases are given. We…

The odd wheel $W_{2k+1}$ is the graph formed by joining a vertex to a cycle of length $2k$. In this paper, we investigate the largest value of the spectral radius of the adjacency matrix of an $n$-vertex graph that does not contain…

A graph is a cograph if it is $P_4$-free. A $k$-polar partition of a graph $G$ is a partition of the set of vertices of $G$ into parts $A$ and $B$ such that the subgraph induced by $A$ is a complete multipartite graph with at most $k$…