Results 71 to 80 of about 140 (117)

Distance signless Laplacian eigenvalues, diameter, and clique number [PDF]

open access: yesDiscrete Mathematics Letters, 2022
Saleem Khan, Shariefuddin Pirzada
doaj   +1 more source

Signless Laplacian spectral radius for a k-extendable graph

open access: yesFilomat
Let k and n be two nonnegative integers with n ? 0 (mod 2), and let G be a graph of order n with a perfect matching. Then G is said to be k-extendable for 0 ? k ? n?2/2 if every matching in G of size k can be extended to a perfect matching. In this paper, we first establish a lower bound on the signless Laplacian spectral radius of G to ensure that G ...
Sizhong Zhou, Yuli Zhang
openaire   +2 more sources

Signless Laplacian spectral radius and fractional matchings in graphs

open access: yes, 2017
A {\it fractional matching} of a graph $G$ is a function $f$ giving each edge a number in $[0,1]$ so that $\sum_{e\in Γ(v)}f(e)\leq 1$ for each $v\in V(G)$, where $Γ(v)$ is the set of edges incident to $v$. The {\it fractional matching number} of $G$, written $α'_{*}(G)$, is the maximum of $\sum_{e\in E(G)}f(e)$ over all fractional matchings $f$.
Liu, Ruifang, Lu, Yu
openaire   +2 more sources

Maxima of the signless Laplacian spectral radius for planar graphs

open access: yes, 2014
The signless Laplacian spectral radius of a graph is the largest eigenvalue of its signless Laplacian. In this paper, we prove that the graph $K_{2}\nabla P_{n-2}$ has the maximal signless Laplacian spectral radius among all planar graphs of order $n\geq 456$.
openaire   +2 more sources

On the signless Laplacian spectral radius of graphs with cut vertices

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

Dissecting molecular network structures using a network subgraph approach. [PDF]

open access: yesPeerJ, 2020
Huang CH   +5 more
europepmc   +1 more source

Home - About - Disclaimer - Privacy