Results 71 to 80 of about 33,403 (178)
On the eccentricity energy and eccentricity spectral radius of graphs with odd diameter
The eccentricity matrix of a graph is defined as the matrix obtained from its distance matrix by retaining the largest elements in each row and column, while the rest elements are set to be zero.
Jianping Li, Jianbin Zhang, Leshi Qiu
core +1 more source
On the generalized distance spectral radius of graphs
The generalized distance spectral radius of a connected graph $G$ is the spectral radius of the generalized distance matrix of $G$, defined by $$D_α(G)=αTr(G)+(1-α)D(G), \;\;0\leα\le 1,$$ where $D(G)$ and $Tr(G)$ denote the distance matrix and diagonal matrix of the vertex transmissions of $G$, respectively.
Cui, Shu-Yu, Tian, Gui-Xian, Zheng, Lu
openaire +2 more sources
The distance signless Laplacian spectral radius of a connected graph [Formula: see text] is the largest eigenvalue of the distance signless Laplacian matrix of [Formula: see text], defined as [Formula: see text], where [Formula: see text] is the distance
Abdollah Alhevaz +2 more
core +1 more source
On the spectral radius and energy of the degree distance matrix of a connected graph
Let GG be a simple connected graph on nn vertices. The degree of a vertex v∈V(G)v\in V\left(G), denoted by dv{d}_{v}, is the number of edges incident with vv and the distance between any two vertices u,v∈V(G)u,v\in V\left(G), denoted by duv{d}_{uv}, is ...
Khan Zia Ullah, Hameed Abdul
doaj +1 more source
Area spectral efficiency of a channel adaptive cellular mobile radio system in a correlated shadowed environment [PDF]
In this paper, the average area spectral efficiency (ASE) in bits/sec/Hz/Km2 of a variable transmission rate, high capacity cellular communication system is studied in a correlated shadowed environment.
Nix, AR, M F Tariq, Tariq,, Fahim, A Nix
core +1 more source
The LHS 6343 system consists of a resolved M-dwarf binary with an evolved, negligibly irradiated brown dwarf (BD), LHS 6343 C, orbiting the primary star.
William Frost +9 more
doaj +1 more source
Sharp upper bounds on the distance spectral radius of a graph
Let M=(mij) be a nonnegative irreducible n×n matrix with diagonal entries 0. The largest eigenvalue of M is called the spectral radius of the matrix M, denoted by ρ(M). In this paper, we give two sharp upper bounds of the spectral radius of matrix M.
Lin, Huiqiu +2 more
core +1 more source
Spectral Properties of the Harary Signless Laplacian and Harary Incidence Energy
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
Low-mass X-ray binaries with a neutron star as the primary object show a complex array of phenomenology during outbursts. The observed variability in X-ray emission primarily arises from changes in the innermost regions of the accretion disk, neutron ...
Sandeep K. Rout +6 more
doaj +1 more source
New bounds on the distance Laplacian and distance signless Laplacian spectral radii
Let G be a simple undirected connected graph. In this paper, new upper bounds on the distance Laplacian spectral radius of G are obtained. Moreover, new lower and upper bounds for the distance signless Laplacian spectral radius of G are derived.
Rojo, Óscar +2 more
core +1 more source

