Results 111 to 120 of about 1,618,968 (159)

Perturbation of the α-spectral radius of complete multipartite graphs

open access: yes上海师范大学学报. 自然科学版
Let G be a graph and α∈[0, 1), Nikiforov merged the adjacency matrix and the signless Laplacian matrix to Aα(G)=αD(G)+(1-α)A(G), where D(G), A(G) are the degree diagonal matrix and the adjacency matrix of G, respectively.
WU Yuhao   +3 more
doaj   +1 more source

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

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

Trees with Four and Five Distinct Signless Laplacian Eigenvalues

open access: yes, 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 ...
Taghvaee, F. (Fatemeh)   +1 more
core  

The bounds of eigenvalues of normalized Laplacian matrice and signless Laplacian matrice

open access: yes, 2013
Bu çalışmada grafın komşuluk matrisi derece matrisi ve Laplacian matrisi yardımıyla tanımlanan işaretsiz(signless) Laplacian matris ile normalleştirilmiş Laplacian matrisin özdeğerleri için sınırlar bulunmuştur.We found the bounds of eigenvalues of ...
Eski, Şehri Gülçiçek
core  

Unifying adjacency, Laplacian, and signless Laplacian theories [PDF]

open access: yes
Let $G$ be a simple graph with associated diagonal matrix of vertex degrees $D(G)$, adjacency matrix $A(G)$, Laplacian matrix $L(G)$ and signless Laplacian matrix $Q(G)$.
Samanta, Aniruddha   +2 more
core  

On the number of spanning trees of graphs. [PDF]

open access: yesScientificWorldJournal, 2014
Bozkurt SB, Bozkurt D.
europepmc   +1 more source

Home - About - Disclaimer - Privacy