Results 91 to 100 of about 13,572 (222)

Distance matrix and Laplacian of a tree with attached graphs

open access: yesLinear Algebra and its Applications, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +3 more sources

The p-spectral radius of the Laplacian matrix

open access: yesApplicable Analysis and Discrete Mathematics, 2018
The p-spectral radius of a graph G=(V,E) with adjacency matrix A is defined as ?(p)(G) = max||x||p=1 xT Ax. This parameter shows connections with graph invariants, and has been used to generalize some extremal problems. In this work, we define the p-spectral radius of the Laplacian matrix L as ?(p)(G) = max||x||p=1 xT Lx.
Eliseu Fritscher   +3 more
openaire   +3 more sources

On the Signless Laplacian ABC-Spectral Properties of a Graph

open access: yesMathematics
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

On distance signless Laplacian spectrum and energy of graphs

open access: yesElectronic Journal of Graph Theory and Applications, 2018
The distance signless Laplacian spectral radius of a connected graph G is the largest eigenvalue of the distance signless Laplacian matrix of G‎, ‎defined as ‎D‎Q(G) = Tr(G) + D(G)‎, ‎where D(G) is the distance matrix of G and Tr(G) is the diagonal ...
Abdollah Alhevaz   +2 more
doaj   +1 more source

On the Seidel Laplacian spectrum of threshold graphs [PDF]

open access: yesJournal of Hyperstructures
A graph which does not contain C4, P4, or 2K2 as its induced subgraphs, is called a threshold graph. In this paper, we consider seidel laplacian matrix of a connected threshold graph and determine the seidel laplacian spectrum. Also, the characterization
Megha P M, Parvathy K S
doaj   +1 more source

On the sum of signless Laplacian spectra of graphs

open access: yesKarpatsʹkì Matematičnì Publìkacìï, 2019
For a simple graph $G(V,E)$ with $n$ vertices, $m$ edges, vertex set $V(G)=\{v_1, v_2, \dots, v_n\}$ and edge set $E(G)=\{e_1, e_2,\dots, e_m\}$, the adjacency matrix $A=(a_{ij})$ of $G$ is a $(0, 1)$-square matrix of order $n$ whose $(i,j)$-entry is ...
S. Pirzada, H.A. Ganie, A.M. Alghamdi
doaj   +1 more source

Home - About - Disclaimer - Privacy