Results 1 to 10 of about 287 (207)
The adjacency spectrum of two new operations of graphs
AKCE International Journal of Graphs and Combinatorics, 2018 Let be a graph and be its adjacency matrix. The eigenvalues of are the eigenvalues of and form the adjacency spectrum, denoted by . In this paper, we introduce two new operations and , and describe the adjacency spectra of and of regular graphs , and ...
Dijian Wang, Yaoping Hou, Zikai Tang
doaj +5 more sources
The kite graph is determined by its adjacency spectrum [PDF]
Applied Mathematics and Computation, 2018 14 pages, 7 ...
Hatice Topcu
exaly +3 more sources
Universal adjacency spectrum of zero divisor graph on the ring and its complement [PDF]
AKCE International Journal of Graphs and Combinatorics, 2021 For a commutative ring R with unity, the zero divisor graph is an undirected graph with all non-zero zero divisors of R as vertices and two distinct vertices u and v are adjacent if and only if uv = 0. For a simple graph G with the adjacency matrix A and
Saraswati Bajaj, Pratima Panigrahi
doaj +2 more sources
The Adjacency Spectrum of Subgroup Graphs of Dihedral Group
IOP Conference Series: Earth and Environmental Science, 2019 Research topics on graph associated with a group are subject of much investigation today as well as research topics on the spectra of graph. However, research on the adjacency spectrum of subgroup graph of dihedral group is not reported yet. By this reason, we determined the adjacency spectrum of subgroup graphs of dihedral group and their complements.
Abdussakir, Abdussakir +3 more
exaly +2 more sources
On the Adjacency, Laplacian, and Signless Laplacian Spectrum of Coalescence of Complete Graphs [PDF]
Journal of Mathematics, 2016 Coalescence as one of the operations on a pair of graphs is significant due to its simple form of chromatic polynomial. The adjacency matrix, Laplacian matrix, and signless Laplacian matrix are common matrices usually considered for discussion under ...
S. R. Jog, Raju Kotambari
doaj +3 more sources
Computing and interpreting the adjacency spectrum of traffic networks
Journal of Computational and Applied Mathematics, 1985 Networks of transportation routes between cities can be considered as graphs in a canonical way. In the geographical literature several suggestions can be found for the interpretation of eigenvalues and eigenvectors of the adjacency matrix of such graphs which are expected to yield a measure for the well-connectedness of the network or for the ...
exaly +2 more sources
Hermitian adjacency spectrum and switching equivalence of mixed graphs
Linear Algebra and Its Applications, 2016 It is shown that an undirected graph $G$ is cospectral with the Hermitian adjacency matrix of a mixed graph $D$ obtained from a subgraph $H$ of $G$ by orienting some of its edges if and only if $H=G$ and $D$ is obtained from $G$ by a four-way switching operation; if $G$ is connected, this happens if and only if $λ_1(G)=λ_1(D)$. All mixed graphs of rank
Bojan Mohar
exaly +3 more sources
$Kite_{p+2,p}$ is determined by its Laplacian spectrum [PDF]
Transactions on Combinatorics, 2021 $Kite_{n,p}$ denotes the kite graph that is obtained by appending complete graph with order $p\geq4$ to an endpoint of path graph with order $n-p$. It is shown that $Kite_{n,p}$ is determined by its adjacency spectrum for all $p$ and $n$ [H.
Hatice Topcu
doaj +1 more source
The H-join of arbitrary families of graphs - the universal adjacency spectrum
Linear Algebra and its Applications, 2022 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Domingos M. Cardoso +2 more
openaire +3 more sources
Contribution of directedness in graph spectra
Physical Review Research, 2022 In graph analyses, directed edges are often approximated to undirected ones so that the adjacency matrices may be symmetric. However, such a simplification has not been thoroughly verified. In this study, we investigate how directedness affects the graph
Masaki Ochi, Tatsuro Kawamoto
doaj +1 more source