Results 31 to 40 of about 440,939 (238)
Distance Laplacian Spectral Radius of the Complements of Trees and Unicyclic Graphs [PDF]
Taiwanese journal of mathematics, 2023 Kang Liu, Dan Li, Yuanyuan Chen
openalex +2 more sources
Mathematics, 2021 Let G be a graph of order n. If the maximal connected subgraph of G has no cut vertex then it is called a block. If each block of graph G is a clique then G is called clique tree.
Shaowei Sun +2 more
doaj +1 more source
Mathematical measures of societal polarisation.
PLoS ONE, 2022 In opinion dynamics, as in general usage, polarisation is subjective. To understand polarisation, we need to develop more precise methods to measure the agreement in society.
Johnathan A Adams +2 more
doaj +2 more sources
A Lower Bound for the Distance Laplacian Spectral Radius of Bipartite Graphs with Given Diameter
Mathematics, 2022 Let G be a connected, undirected and simple graph. The distance Laplacian matrix L(G) is defined as L(G)=diag(Tr)−D(G), where D(G) denotes the distance matrix of G and diag(Tr) denotes a diagonal matrix of the vertex transmissions.
Linming Qi +3 more
doaj +1 more source
On graphs with distance Laplacian eigenvalues of multiplicity n−4
AKCE International Journal of Graphs and Combinatorics, 2023 Let G be a connected simple graph with n vertices. The distance Laplacian matrix [Formula: see text] is defined as [Formula: see text], where [Formula: see text] is the diagonal matrix of vertex transmissions and [Formula: see text] is the distance ...
Saleem Khan, S. Pirzada, A. Somasundaram
doaj +1 more source
Shock and Vibration, 2022 In this study, the effect of urban subway tunnels with a circular cross section on the spectral velocity of the ground surface in alluvial soils was investigated.
Hamed Fakhriyeh +2 more
doaj +1 more source
A Sharp upper bound for the spectral radius of a nonnegative matrix and applications [PDF]
, 2016 In this paper, we obtain a sharp upper bound for the spectral radius of a nonnegative matrix. This result is used to present upper bounds for the adjacency spectral radius, the Laplacian spectral radius, the signless Laplacian spectral radius, the ...
Shu, Yujie, You, Lihua, Zhang, Xiao-Dong
core +2 more sources
Combined Spectral and Timing Analysis of the Black Hole Candidate MAXI J1659-152 Discovered by MAXI and Swift [PDF]
, 2011 We report on X-ray spectral and timing results of the new black hole candidate (BHC) MAXI J1659-152 with the orbital period of 2.41 hours (shortest among BHCs) in the 2010 outburst from 65 Rossi X-ray Timing Explorer (RXTE) observations and 8 ...
Allured, Ryan +14 more
core +3 more sources
On the General Sum Distance Spectra of Digraphs
Mathematics, 2023 Let G be a strongly connected digraph, and dG(vi,vj) denote the distance from the vertex vi to vertex vj and be defined as the length of the shortest directed path from vi to vj in G.
Weige Xi +3 more
doaj +1 more source
Some inequalities involving the distance signless Laplacian eigenvalues of graphs [PDF]
Transactions on Combinatorics, 2021 Given a simple graph $G$, the distance signlesss Laplacian $D^{Q}(G)=Tr(G)+D(G)$ is the sum of vertex transmissions matrix $Tr(G)$ and distance matrix $D(G)$.
Abdollah Alhevaz +3 more
doaj +1 more source