نتایج جستجو برای: cospectral graphs

تعداد نتایج: 97314  

Journal: :Applied Mathematics and Computation 2021

2002
m. j. p. peeters

Let be a distance-regular graph with adjacency matrix A. Let I be the identity matrix and J the all-1 matrix. Let p be a prime. We study the p-rank of the matrices A + bJ − cI for integral b, c and the p-rank of corresponding matrices of graphs cospectral with . Using the minimal polynomial of A and the theory of Smith normal forms we first determine which p-ranks of A follow directly from the ...

Journal: :Linear Algebra and its Applications 2017

Journal: :Linear Algebra and its Applications 2018

Journal: :Discussiones Mathematicae Graph Theory 2017

2018
Xueyi Huang Qiongxiang Huang Lu Lu XUEYI HUANG

Let G be a connected graph on n vertices, and let D(G) be the distance matrix of G. Let ∂1(G) ≥ ∂2(G) ≥ · · · ≥ ∂n(G) denote the eigenvalues of D(G). In this paper, the connected graphs with ∂n−1(G) at least the smallest root of x3 − 3x2 − 11x− 6 = 0 are determined. Additionally, some non-isomorphic distance cospectral graphs are given.

2008
Steve Butler

In this note we show how to construct two distinct bipartite graphs which are cospectral for both the adjacency and normalized Laplacian matrices by “unfolding” a base bipartite graph in two different ways.

Let $S(G^{sigma})$ be the skew-adjacency matrix of the oriented graph $G^{sigma}$, which is obtained from a simple undirected graph $G$ by assigning an orientation $sigma$ to each of its edges. The skew energy of an oriented graph $G^{sigma}$ is defined as the sum of absolute values of all eigenvalues of $S(G^{sigma})$. Two oriented graphs are said to be skew equienergetic iftheir skew energies...

Journal: :Linear Algebra and its Applications 2007

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید