Results 101 to 110 of about 68,836 (161)

Persistent Mayer Dirac. [PDF]

J Phys Complex
Suwayyid F, Wei GW.
europepmc   +1 more source

Enumerating and indexing many-body intramolecular interactions: a graph theoretic approach. [PDF]

J Math Chem, 2015
Penfold R, Wilde PJ.
europepmc   +1 more source

Layout analysis of the RCEP international airline network based on hub identification using improved contribution matrix. [PDF]

Sci Rep
Yang W, Chi Y, Huang Y, Wei W, Xu Z.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

On the Distance Signless Laplacian Spectrum of Graphs

Bulletin of the Malaysian Mathematical Sciences Society, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alhevaz, A., Baghipur, M., Hashemi, E., Ramane, H. S.   +3 more
openaire   +4 more sources

On the signless Laplacian and normalized signless Laplacian spreads of graphs

Czechoslovak Mathematical Journal, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Milovanović, Emina, Bozkurt Altindağ, Serife B., Matejić, Marjan, Milovanović, Igor   +3 more
openaire   +1 more source

Signless Laplacian spectral radius for a k-extendable graph

Filomat, 2023
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,
Sizhong Zhou, Yuli Zhang
semanticscholar   +1 more source

The signless Laplacian spectral Turán problems for color-critical graphs

Linear Algebra and its Applications
The well-known Tur\'{a}n theorem states that if $G$ is an $n$-vertex $K_{r+1}$-free graph, then $e(G)\le e(T_{n,r})$, with equality if and only if $G$ is the $r$-partite Tur\'{a}n graph $T_{n,r}$.
Jian Zheng, Yongtao Li, Honghai Li
semanticscholar   +1 more source

A signless Laplacian spectral Erdős-Stone-Simonovits theorem

Discrete Mathematics
The celebrated Erd\H{o}s--Stone--Simonovits theorem states that $\mathrm{ex}(n,F)= \big(1-\frac{1}{\chi(F)-1}+o(1) \big)\frac{n^{2}}{2}$, where $\chi(F)$ is the chromatic number of $F$.
Jian Zheng, Honghai Li, Li Su
semanticscholar   +1 more source

Determining some graph joins by the signless Laplacian spectrum

Discrete Applied Mathematics
A graph is determined by its signless Laplacian spectrum if there is no other non-isomorphic graph sharing the same signless Laplacian spectrum. Let $C_l$, $P_l$, $K_l$ and $K_{s,l-s}$ be the cycle, the path, the complete graph and the complete bipartite
Jiachang Ye, Jianguo Qian, Zoran Stanić
semanticscholar   +1 more source

Some bounds for distance signless Laplacian energy-like invariant of networks

Carpathian Mathematical Publications
For a graph or network $G$, denote by $D(G)$ the distance matrix and $Tr(G)$ the diagonal matrix of vertex transmissions. The distance signless Laplacian matrix of $G$ is $D^{Q}(G)=Tr(G)+D(G)$.
A. Alhevaz, M. Baghipur, S. Pirzada, Y. Shang   +3 more
semanticscholar   +1 more source