Results 71 to 80 of about 858 (123)
Spectra of Graphs Resulting from Various Graph Operations and Products: a Survey
Let G be a graph on n vertices and A(G), L(G), and |L|(G) be the adjacency matrix, Laplacian matrix and signless Laplacian matrix of G, respectively. The paper is essentially a survey of known results about the spectra of the adjacency, Laplacian and ...
Barik S., Kalita D., Pati S., Sahoo G.
doaj +1 more source
Spektrum Signless-Laplace dan Spektrum Detour Graf Konjugasi dari Grup Dihedral
Misalkan G graf berhingga yang tidak memuat loop dan sisi rangkap. Matriks keterhubungan titik A(G) dari graf G adalah matriks dengan entri aij = 1 jika vi terhubung langsung dengan vj dan aij = 0 untuk lainnya.
Abdussakir Abdussakir, Rhoul Khasanah
doaj +1 more source
On the Signless Laplacian ABC-Spectral Properties of a Graph
In the paper, we introduce the signless Laplacian ABC-matrix Q̃(G)=D¯(G)+Ã(G), where D¯(G) is the diagonal matrix of ABC-degrees and Ã(G) is the ABC-matrix of G. The eigenvalues of the matrix Q̃(G) are the signless Laplacian ABC-eigenvalues of G.
Bilal A. Rather +2 more
doaj +1 more source
Suppose that G is a simple undirected connected graph. Denote by D ( G ) the distance matrix of G and by T r ( G ) the diagonal matrix of the vertex transmissions in G, and let α ∈ [ 0 , 1 ] .
Abdollah Alhevaz +2 more
doaj +1 more source
Signless and normalized Laplacian spectrums of the power graph and its supergraphs of certain finite groups [PDF]
The aim of this article is to compute the signless and normalized Laplacian spectrums of the power graph, its main supergraph and cyclic graph of dihedral and dicyclic groups.
openaire +2 more sources
Spectra of Subdivision Vertex-Edge Join of Three Graphs
In this paper, we introduce a new graph operation called subdivision vertex-edge join (denoted by G 1 S ▹ ( G 2 V ∪ G 3 E ) for short), and then the adjacency spectrum, the Laplacian spectrum and the signless Laplacian spectrum of
Fei Wen, You Zhang, Muchun Li
doaj +1 more source
Two graphs are said to be Q-cospectral if they share the same signless Laplacian spectrum. A simple graph is said to be determined by its signless Laplacian spectrum (abbreviated as DQS) if there exists no other non-isomorphic simple graph with the same ...
Ye Jiachang, Qian Jianguo, Stanić Zoran
doaj +1 more source
Laplacian spectra and structural insights: applications in chemistry and network science
This paper presents the practical applications of Laplacian and signless Laplacian spectra across various fields including theoretical chemistry, computer science, electrical engineering, and complex network analysis.
Ali Raza, Muhammad Mobeen Munir
doaj +1 more source
Some sufficient conditions on hamilton graphs with toughness. [PDF]
Cai G, Yu T, Xu H, Yu G.
europepmc +1 more source
Quantitative structure-properties relationship analysis of Eigen-value-based indices using COVID-19 drugs structure. [PDF]
Rauf A, Naeem M, Hanif A.
europepmc +1 more source

