Results 1 to 10 of about 7,057,923 (115)

Minimum covering reciprocal distance signless Laplacian energy of graphs

Acta Universitatis Sapientiae, Informatica, 2018
Let G be a simple connected graph. The reciprocal transmission Tr′G(ν) of a vertex ν is defined as TrG′(ν)=∑u∈V(G)1dG(u,ν),           u≠ν. $${\rm{Tr}}_{\rm{G}}^\prime ({\rm{\nu }}) = \sum\limits_{{\rm{u}} \in {\rm{V}}(G)} {{1 \over {{{\rm{d}}_{\rm{G}}}(u,
A. Alhevaz, M. Baghipur, E. Hashemi, Yaser Alizadeh   +3 more
semanticscholar   +3 more sources

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   +2 more sources

On the eigenvalues of the distance signless Laplacian matrix of graphs

Proyecciones (antofagasta)
Let G be a connected graph and let DQ(G) be the distance signless Laplacian matrix of G with eigenvalues ρ1≥ ρ2≥…≥ ρn. The spread of the matrix DQ}(G) is defined as s(DQ(G)) := maxi,j| ρi-ρj| = ρ1- ρn.
A. Jahanbani, Hajar Shooshtari, M. E. Haq, S. Pirzada   +3 more
semanticscholar   +2 more sources

Resistance Distance and Kirchhoff Index for a Class of Graphs

Mathematical Problems in Engineering, Volume 2018, Issue 1, 2018., 2018
Let G[F, Vk, Hv] be the graph with k pockets, where F is a simple graph of order n ≥ 1, Vk = {v1, v2, …, vk} is a subset of the vertex set of F, Hv is a simple graph of order m ≥ 2, and v is a specified vertex of Hv. Also let G[F, Ek, Huv] be the graph with k edge pockets, where F is a simple graph of order n ≥ 2, Ek = {e1, e2, …ek} is a subset of the ...
WanJun Yin, ZhengFeng Ming, Qun Liu, Jean Jacques Loiseau   +3 more
wiley   +1 more source

Spectral distances in some sets of graphs

Revista de la Unión Matemática Argentina, 2022
Some of the spectral distance related parameters (cospectrality, spectral eccentricity, and spectral diameter with respect to an arbitrary graph matrix) are determined in one particular set of graphs.
Irena M. Jovanović
semanticscholar   +1 more source

Generalized Characteristic Polynomials of Join Graphs and Their Applications

Discrete Dynamics in Nature and Society, Volume 2017, Issue 1, 2017., 2017
The Kirchhoff index of G is the sum of resistance distances between all pairs of vertices of G in electrical networks. LEL(G) is the Laplacian‐Energy‐Like Invariant of G in chemistry. In this paper, we define two classes of join graphs: the subdivision‐vertex‐vertex join G1⊚G2 and the subdivision‐edge‐edge join G1⊝G2.
Pengli Lu, Ke Gao, Yang Yang, Francisco R. Villatoro   +3 more
wiley   +1 more source

Investigating Signless Laplacian Spectra and Network Topology in Helical Phenylene‐Quadrilateral Structures

Journal of Mathematics, Volume 2025, Issue 1, 2025.
This study investigates the spectral and topological properties of rounded knot networks K2n, a helical extension of phenylene quadrilateral structures, through signless Laplacian spectral analysis. Motivated by the need to understand how helical topology influences network dynamics and robustness, we derive exact analytical expressions for three key ...
Fareeha Hanif, Ali Raza, Md. Shajib Ali, Pramita Mishra   +3 more
wiley   +1 more source

QSPR analysis for physiochemical properties of new potential antimalarial compounds involving topological indices

International Journal of Quantum Chemistry, Volume 124, Issue 11, June 5, 2024.
Molecular structures. Abstract Malaria has a wide impact on the healthcare system, affecting everyone from hyperendemic areas who dearth access to medical treatment to international tourists returning to nonendemic regions with tertiary referral care. Implementing timely and accurate diagnosis is necessary to stop malaria's growing global effect, which
Nadeem ul Hassan Awan, Abdul Ghaffar, Ferdous M. Tawfiq, Ghulam Mustafa, Muhammad Bilal, Mustafa Inc   +5 more
wiley   +1 more source

Distance Spectra of Some Double Join Operations of Graphs

International Journal of Mathematics and Mathematical Sciences, Volume 2024, Issue 1, 2024.
In literature, several types of join operations of two graphs based on subdivision graph, Q‐graph, R‐graph, and total graph have been introduced, and their spectral properties have been studied. In this paper, we introduce a new double join operation based on (H1, H2)‐merged subdivision graph.
B. J. Manjunatha, B. R. Rakshith, K. N. Prakasha, N. V. Sayinath Udupa, Abdul Rauf Khan   +4 more
wiley   +1 more source

On generalized distance energy of graphs

Linear Algebra and its Applications, 2019
For the distance matrix D ( G ) and diagonal matrix of the vertex transmissions T r ( G ) of a simple connected graph G, the generalized distance matrix D α ( G ) is the convex combinations of T r ( G ) and D ( G ) , and is defined as D α ( G ) = α T r (
S. Pirzada, H. A. Ganie, B. Rather, Rezwan Ul Shaban   +3 more
semanticscholar   +1 more source