Results 31 to 40 of about 33,403 (178)
NEW BOUNDS AND EXTREMAL GRAPHS FOR DISTANCE SIGNLESS LAPLACIAN SPECTRAL RADIUS [PDF]
The distance signless Laplacian spectral radius of a connected graph $G$ is the largest eigenvalue of the distance signless Laplacian matrix of $G$, defined as $D^{Q}(G)=Tr(G)+D(G)$, where $D(G)$ is the distance matrix of $G$ and $Tr(G)$ is the diagonal ...
A. Alhevaz, M. Baghipur, S. Paul
doaj +1 more source
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
If $Tr(G)$ and $D(G)$ are respectively the diagonal matrix of vertex transmission degrees and distance matrix of a connected graph $G$, the generalized distance matrix $D_{\alpha}(G)$ is defined as $D_{\alpha}(G)=\alpha ~Tr(G)+(1-\alpha)~D(G)$, where $0 ...
M. Merajuddin, S. Bhatnagar, S. Pirzada
doaj +1 more source
Spanning k-trees and distance spectral radius in graphs
11 ...
Sizhong Zhou, Jiancheng Wu
openaire +3 more sources
Mathematical measures of societal polarisation.
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
On graphs with distance Laplacian eigenvalues of multiplicity n−4
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
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]
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
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
Experimental realization of a Fresnel hologram as a super spectral resolution optical element
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

