Results 11 to 20 of about 110,880 (163)

(Generalized) Incidence and Laplacian-Like Energies

open access: yesJournal of Mathematics, 2023
In this study, for graph Γ with r connected components (also for connected nonbipartite and connected bipartite graphs) and a real number ε≠0,1, we found generalized and improved bounds for the sum of ε-th powers of Laplacian and signless Laplacian ...
A. Dilek Maden, Mohammad Tariq Rahim
doaj   +2 more sources

Bounding the sum of the largest signless Laplacian eigenvalues of a graph [PDF]

open access: yesDiscrete Applied Mathematics, 2023
arXiv admin note: text overlap with arXiv:1412 ...
Aida Abiad   +4 more
openaire   +7 more sources

Eigenvalue bounds for the signless laplacian [PDF]

open access: yesPublications de l'Institut Mathematique, 2007
We extend our previous survey of properties of spectra of signless Laplacians of graphs. Some new bounds for eigenvalues are given, and the main result concerns the graphs whose largest eigenvalue is maximal among the graphs with fixed numbers of vertices and edges. The results are presented in the context of a number of computer-generated conjectures.
Cvetkovic, Dragos   +2 more
openaire   +3 more sources

On Sum of Powers of the Laplacian and Signless Laplacian Eigenvalues of Graphs [PDF]

open access: yesThe Electronic Journal of Combinatorics, 2010
Let $G$ be a graph of order $n$ with signless Laplacian eigenvalues $q_1, \ldots,q_n$ and Laplacian eigenvalues $\mu_1,\ldots,\mu_n$. It is proved that for any real number $\alpha$ with $0 < \alpha\leq1$ or $2\leq\alpha < 3$, the inequality $q_1^\alpha+\cdots+ q_n^\alpha\geq \mu_1^\alpha+\cdots+\mu_n^\alpha$ holds, and for any real number ...
Saieed Akbari   +3 more
openaire   +4 more sources

Two Kinds of Laplacian Spectra and Degree Kirchhoff Index of the Weighted Corona Networks

open access: yesJournal of Mathematics, 2022
Recently, the study related to network has aroused wide attention of the scientific community. Many problems can be usefully represented by corona graphs or networks.
Haiqin Liu, Yanling Shao
doaj   +2 more sources

On the sum of signless Laplacian eigenvalues of a graph [PDF]

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

Majorization bounds for signless Laplacian eigenvalues

open access: yesThe Electronic Journal of Linear Algebra, 2013
It is known that, for a simple graph G and a real number , the quantity s0 (G) is defined as the sum of the -th power of non-zero singless Laplacian eigenvalues of G. In this paper, first some majorization bounds over s 0(G) are presented in terms of the degree sequences, and number of vertices and edges of G. Additionally, a connection between s 0(G)
Maden, A. Dilek, Cevik, A. Sinan
openaire   +3 more sources

Trees with Four and Five Distinct Signless Laplacian Eigenvalues [PDF]

open access: yesJournal of the Indonesian Mathematical Society, 2019
‎‎Let $G$ be a simple graph with vertex set $V(G)=\{v_1‎, ‎v_2‎, ‎\cdots‎, ‎v_n\}$ ‎and‎‎edge set $E(G)$‎.‎The signless Laplacian matrix of $G$ is the matrix $‎Q‎‎=‎D‎+‎A‎‎$‎, ‎such that $D$ is a diagonal ‎matrix‎%‎‎, ‎indexed by the vertex set of $G$ where‎‎%‎$D_{ii}$ is the degree of the vertex $v_i$ ‎‎‎ and $A$ is the adjacency matrix of $G ...
Taghvaee, Fatemeh   +1 more
openaire   +3 more sources

Graphs with the second signless Laplacian eigenvalue ≤ 4

open access: yesSpecial Matrices, 2021
We discuss the question of classifying the connected simple graphs H for which the second largest eigenvalue of the signless Laplacian Q(H) is ≤ 4. We discover that the question is inextricable linked to a knapsack problem with infinitely many allowed ...
Drury Stephen
doaj   +3 more sources

The smallest eigenvalue of the signless Laplacian

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

Home - About - Disclaimer - Privacy