Results 1 to 10 of about 2,858,268 (305)
The adjacency spectrum of two new operations of graphs
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 +6 more sources
The kite graph is determined by its adjacency spectrum [PDF]
14 pages, 7 ...
Topcu, Hatice, Sorgun, Sezer
semanticscholar +6 more sources
Hermitian adjacency spectrum and switching equivalence of mixed graphs [PDF]
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)$.
B. Mohar
semanticscholar +5 more sources
Computing and interpreting the adjacency spectrum of traffic networks
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 ...
C. Maas
semanticscholar +4 more sources
On the Adjacency, Laplacian, and Signless Laplacian Spectrum of Coalescence of Complete Graphs [PDF]
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 +4 more sources
On the Displacement of Eigenvalues When Removing a Twin Vertex [PDF]
Twin vertices of a graph have the same open neighbourhood. If they are not adjacent, then they are called duplicates and contribute the eigenvalue zero to the adjacency matrix.
Briffa Johann A., Sciriha Irene
doaj +3 more sources
Adjacency Sequence and Adjacency Spectrum of Power Fuzzy Graphs
Objectives: To find the adjacency sequence, spectrum of the power fuzzy graphs and discuss its properties. Methods: The spectrum and energy of the power fuzzy graphs are derived using the adjacency matrices. Energy of the power fuzzy graph is computed by adding the absolute eigenvalues of the adjacency matrix.
S Shiny Paulin, T Bharathi
openaire +2 more sources
The Adjacency Spectrum of Subgroup Graphs of Dihedral Group
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
openaire +2 more sources
The Generalized Distance Spectrum of the Join of Graphs [PDF]
Let G be a simple connected graph. In this paper, we study the spectral properties of the generalized distance matrix of graphs, the convex combination of the symmetric distance matrix D(G) and diagonal matrix of the vertex transmissions Tr(G) .
Alhevaz, Abdollah +3 more
core +3 more sources
THE ADJACENCY SPECTRUM OF TRIANGULAR BOOK GRAPHS
Graph theory is a branch of mathematics that in its application represents objects with vertices and relationships between objects with edges. One of the studies of graph theory is the graph spectrum which is the arrangement of eigenvalues and their multiplicity.
Hafif Komarullah
openaire +2 more sources

