Results 81 to 90 of about 306 (150)

A Note on the Spectral Radius of Weighted Signless Laplacian Matrix

open access: yesAdvances in Linear Algebra & Matrix Theory, 2018
A weighted graph is a graph that has a numeric label associated with each edge, called the weight of edge. In many applications, the edge weights are usually represented by nonnegative integers or square matrices. The weighted signless Laplacian matrix of a weighted graph is defined as the sum of adjacency matrix and degree matrix of same weighted ...
KAYA GÖK, GÜLİSTAN   +2 more
openaire   +3 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

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