Results 31 to 40 of about 1,618,968 (159)

The Second Immanantal Polynomial for the Signless Laplacian Matrix of a Graph

Axioms
The second immanantal polynomial is one of the important directions in algebraic theory. Let M=[mij] be an n×n matrix. The second immanant of matrix M is defined as d2(M)=∑σ∈Snχ(σ)∏i=1nmiσ(i), where χ is the irreducible character of the symmetric group ...
Yafan Geng, Tingzeng Wu
doaj   +3 more sources

On Generalized Harary Eigenvalues and Generalized Join of Graphs

Journal of Mathematics
In this work, we further study the generalized Harary matrix of a connected graph G, which we denote by RDαG. This matrix is defined as the convex combination RDαG=αRTG+1−αRDG, where 0≤α≤1.
Abdollah Alhevaz, Maryam Baghipur, Hilal A. Ganie, Yilun Shang   +3 more
doaj   +2 more sources

On the Signless Laplacian ABC-Spectral Properties of a Graph

Mathematics
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, Hilal A. Ganie, Yilun Shang   +2 more
doaj   +2 more sources

NEW BOUNDS AND EXTREMAL GRAPHS FOR DISTANCE SIGNLESS LAPLACIAN SPECTRAL RADIUS [PDF]

Journal of Algebraic Systems, 2021
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 ...
A. Alhevaz, M. Baghipur, S. Paul
doaj   +1 more source

Chromatic number and signless Laplacian spectral radius of graphs [PDF]

Transactions on Combinatorics, 2022
For any simple graph $G$, the signless Laplacian matrix of $G$ is defined as $D(G)+A(G)$, where $D(G)$ and $A(G)$ are the diagonal matrix of vertex degrees and the adjacency matrix of $G$, respectively.
Mohammad Reza Oboudi
doaj   +1 more source

On the signless Laplacian and normalized signless Laplacian spreads of graphs [PDF]

, 2023
summary:Let $G=(V,E)$, $V=\{v_1,v_2,\ldots ,v_n\}$, be a simple connected graph with $n$ vertices, $m$ edges and a sequence of vertex degrees $d_1\geq d_2\geq \cdots \geq d_n$.
Milovanović, Emina, Bozkurt Altindağ, Serife B., Matejić, Marjan, Milovanović, Igor   +3 more
core   +3 more sources

On the Signless Laplacian Eigenvalues and Optimum SLE of Graph

Fuzzy Optimization and Modeling, 2022
Let G be a graph of order n and with the vertex set {v_1,v_2,…,v_n } and the edge set E(G). The adjancency matrix of G is an n×n matrix A(G) whose (i,j)-entry is 1 if v_i is adjacent to v_j and 0, otherwise.
Gholam Hossein Fath-Tabar
doaj   +1 more source

Signless laplacian spectral characterization of roses

Kuwait Journal of Science, 2020
A p-rose graph Γ = RG(a3, a4, . . . , as) is a graph consisting of p =a3 + a4 + · · · + as ≥ 2 cycles that all meet in one vertex, and ai (3 ≤ i ≤ s) is the number of cycles in Γ of length i.
ALI ZEYDI ABDIAN, ALI REZA ASHRAFI, Maurizion Brunetti   +2 more
doaj   +1 more source

Principal eigenvector of the signless Laplacian matrix [PDF]

Computational and Applied Mathematics, 2021
In this paper, we study the entries of the principal eigenvector of the signless Laplacian matrix of a hypergraph. More precisely, we obtain bounds for this entries. These bounds are computed trough other important parameters, such as spectral radius, maximum and minimum degree.
openaire   +2 more sources

An analog of Matrix Tree Theorem for signless Laplacians [PDF]

Linear Algebra and its Applications, 2019
A spanning tree of a graph is a connected subgraph on all vertices with the minimum number of edges. The number of spanning trees in a graph $G$ is given by Matrix Tree Theorem in terms of principal minors of Laplacian matrix of $G$. We show a similar combinatorial interpretation for principal minors of signless Laplacian $Q$.
Keivan Hassani Monfared, Sudipta Mallik
openaire   +3 more sources