Results 61 to 70 of about 140 (117)

A Spectrum-Based Approach to Network Analysis Utilizing Laplacian and Signless Laplacian Spectra to Torus Networks

open access: yesIEEE Access
Exploring the applications of Laplacian and signless Laplacian spectra extends beyond theoretical chemistry, computer science, electrical networks, and complex networks.
Ali Raza   +3 more
doaj   +1 more source

Laplacian spectra and structural insights: applications in chemistry and network science

open access: yesFrontiers in Applied Mathematics and Statistics
This paper presents the practical applications of Laplacian and signless Laplacian spectra across various fields including theoretical chemistry, computer science, electrical engineering, and complex network analysis.
Ali Raza, Muhammad Mobeen Munir
doaj   +1 more source

Some Turán-type results for the signless Laplacian spectral radius

open access: yesEuropean Journal of Combinatorics
Half a century ago, Bollobás and Erdős [Bull. London Math. Soc. 5 (1973)] proved that every $n$-vertex graph $G$ with $e(G)\ge (1- \frac{1}{k} + \varepsilon )\frac{n^2}{2}$ edges contains a blowup $K_{k+1}[t]$ with $t=Ω_{k,\varepsilon}(\log n)$. A well-known theorem of Nikiforov [Combin. Probab. Comput.
Jian Zheng, Yongtao Li, Yi-Zheng Fan
openaire   +2 more sources

Spectral and Sharp Sufficient Conditions for Graphs to Admit a Strong Star Factor

open access: yesMathematics
LetGbe a graph. An odd [1,k]-factor of a graph G is a spanning subgraph H of G such that degH(v) is odd and 1⩽degH(v)⩽k for every v∈V(G) where k is a positive odd integer. We call a spanning subgraph H of a graph G a strong star factor if every component
Fengyun Ren, Shumin Zhang, He Li
doaj   +1 more source

Transmission-Based Energies of Prime Coprime Graph for Integers Modulo Group

open access: yesScience and Technology Indonesia
Graphs are an excellent instrument that provides an algebraic structure for visualizing and interpreting molecule structures and characteristics. As a result, the problem statement arises regarding how we can interpret graphs with eigenvalues concerning
Mamika Ujianita Romdhini   +3 more
doaj   +1 more source

On the distance signless Laplacian spectral radius of graphs and digraphs

open access: yesThe Electronic Journal of Linear Algebra, 2017
Let \eta(G) denote the distance signless Laplacian spectral radius of a connected graph G. In this paper,bounds for the distance signless Laplacian spectral radius of connected graphs are given, and the extremal graph with the minimal distance signless Laplacian spectral radius among the graphs with given vertex connectivity and minimum degree is ...
Dan Li, Guoping Wang, Jixiang Meng
openaire   +1 more source

The (signless Laplacian) spectral radius (of subgraphs) of uniform hypergraphs

open access: yesFilomat, 2019
Let ?1(G) and q1(G) be the spectral radius and the signless Laplacian spectral radius of a kuniform hypergraph G, respectively. In this paper, we give the lower bounds of d-?1(H) and 2d-q1(H), where H is a proper subgraph of a f (-edge)-connected d-regular (linear) k-uniform hypergraph.
Duan, Cunxiang   +3 more
openaire   +2 more sources

Spectral Properties of the Harary Signless Laplacian and Harary Incidence Energy

open access: yesMathematics
Let X be a partitioned matrix and let B its equitable quotient matrix. Consider a simple, undirected, connected graph G of order n. In this paper, we employ a technique based on quotient matrices derived from block-partitioned structures to establish new
Luis Medina   +2 more
doaj   +1 more source

Home - About - Disclaimer - Privacy