Results 31 to 40 of about 120 (101)
, 2018 The \emph{distance matrix} of a simple connected graph $G$ is $D(G)=(d_{ij})$, where $d_{ij}$ is the distance between the $i$th and $j$th vertices of $G$. The \emph{distance signless Laplacian matrix} of the graph $G$ is $D_Q(G)=D(G)+Tr(G)$, where $Tr(G)$
Panigrahi, Pratima, Atik, Fouzul
core +1 more source
Ain Shams Engineering JournalIn this study, we define the structure formation of the annihilator monic prime graph of commutative rings, whose distinct vertices X and J satisfies a condition annXJ≠annX⋃ann(J), graph is denoted by AMPG(Zn[x]/〈fx〉).
R. Sarathy, J. Ravi Sankar
doaj +1 more source
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 +3 more
wiley +1 more source
, 2023 Let G be a connected graph of even order n. An odd [1, b]-factor of G is a spanning subgraph F of G such that dF(v) ∈ {1, 3, 5, ⋯, b} for any v ∈ V(G), where b is positive odd integer.
Hongxia Liu, Sizhong Zhou
core +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 +4 more
wiley +1 more source
Further results on the distance signless Laplacian spectrum of graphs
, 2018 The distance signless Laplacian matrix [Formula: see text] of a connected graph [Formula: see text] is defined as [Formula: see text], where [Formula: see text] is the distance matrix of [Formula: see text] and [Formula: see text] is the diagonal matrix
Abdollah Alhevaz +2 more
core +1 more source
Spectra of closeness Laplacian and closeness signless Laplacian of graphs
, 2022 For a graph G with vertex set V(G) and u, v ∈ V(G), the distance between vertices u and v in G, denoted by dG(u,v), is the length of a shortest path connecting them and it is ∞ if there is no such a path, and the closeness of vertex u in G is $ {c}_G(u)={
Bo Zhou, Lu Zheng
core +1 more source
Bounds for the Generalized Distance Eigenvalues of a Graph [PDF]
, 2019 Let G be a simple undirected graph containing n vertices. Assume G is connected. Let D(G) be the distance matrix, DL(G) be the distance Laplacian, DQ(G) be the distance signless Laplacian, and Tr(G) be the diagonal matrix of the vertex transmissions ...
Abdollah Alhevaz +7 more
core +1 more source
On the multiplicity of Laplacian eigenvalues for unicyclic graphs [PDF]
, 2022 summary:Let $G$ be a connected graph of order $n$ and $U$ a unicyclic graph with the same order. We firstly give a sharp bound for $m_{G}(\mu )$, the multiplicity of a Laplacian eigenvalue $\mu $ of $G$. As a straightforward result, $m_{U}(1)\le n-2$. We
Wen, Fei, Huang, Qiongxiang
core +1 more source
Enumeration of cospectral and coinvariant graphs
, 2021 We present enumeration results on the number of connected graphs up to 10 vertices for which there is at least one other graph with the same spectrum (cospectral mate), or at least one other graph with the same Smith normal form (coinvariant mate) with ...
Alfaro, Carlos A. +4 more
core +1 more source