Results 21 to 30 of about 34,618 (252)
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
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
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
Upper and Lower Bounds for the Spectral Radius of Generalized Reciprocal Distance Matrix of a Graph
Mathematics, 2022 For a connected graph G on n vertices, recall that the reciprocal distance signless Laplacian matrix of G is defined to be RQ(G)=RT(G)+RD(G), where RD(G) is the reciprocal distance matrix, RT(G)=diag(RT1,RT2,⋯,RTn) and RTi is the reciprocal distance ...
Yuzheng Ma, Yubin Gao, Yanling Shao
doaj +1 more source
Experimental realization of a Fresnel hologram as a super spectral resolution optical element
Scientific Reports, 2021 A highly dispersive, diffractive optical element is designed and realized for an extremely high spectral resolution spectroscopy for exoplanet telescope application.
Mei-Li Hsieh +5 more
doaj +1 more source
On distance spectral radius of graphs
Linear Algebra and its Applications, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wang, Yanna, Zhou, Bo
openaire +1 more source
On the distance energy of k-uniform hypergraphs
Special Matrices, 2023 In this article, we extend the concept of distance energy for hypergraphs. We first establish a relation between the distance energy and the distance spectral radius.
Sharma Kshitij, Panda Swarup Kumar
doaj +1 more source