Results 81 to 90 of about 1,309,008 (158)
Ordering cacti with signless Laplacian spread [PDF]
, 2018 A cactus is a connected graph in which any two cycles have at most one vertex in common. The signless Laplacian spread of a graph is defined as the difference between the largest eigenvalue and the smallest eigenvalue of the associated signless Laplacian
Lin, Zhen, Guo, Shu-Guang
core +1 more source
Spectra of Graphs Resulting from Various Graph Operations and Products: a Survey
Special Matrices, 2018 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
IEEE Access, 2018 The resistance distance is widely used in random walk, electronic engineering, and complex networks. One of the main topics in the study of the resistance distance is the computation problem.
Qun Liu, Jia-Bao Liu, Shaohui Wang
doaj +1 more source
Signless and normalized Laplacian spectrums of the power graph and its supergraphs of certain finite groups [PDF]
Journal of the Indonesian Mathematical Society, 2018 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
Spektrum Signless-Laplace dan Spektrum Detour Graf Konjugasi dari Grup Dihedral
Kubik, 2018 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 Distance Signless Laplacian Spectral Radius and Distance Signless Laplacian Energy
, 2020 In this article, we find sharp lower bounds for the spectral radius of the distance signless Laplacian matrix of a simple undirected connected graph and we apply these results to obtain sharp upper bounds for the distance signless Laplacian energy graph.
Hans Nina, Luis Medina, Macarena Trigo
core +1 more source
Some Results on the Signless Laplacian Spectra of Unicyclic Graphs [PDF]
, 2011 We determine the second to fourth largest (resp. the second smallest) signless Laplacian spectral radii and the second to fourth largest signless Laplacian spreads together with the corresponding graphs in the class of unicyclic graphs with n vertices ...
Muhuo Liu
core +1 more source
Moore-Penrose Inverses of the Signless Laplacian and Edge-Laplacian of Graphs
, 2021 The signless Laplacian Q and signless edge-Laplacian S of a given graph may or may not be invertible. The Moore-Penrose inverses of Q and S are studied.
Mallik, Sudipta, Hassert, Ryan
core +1 more source
Special MatricesTwo 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
Mathematics, 2019 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