Results 1 to 10 of about 33,403 (178)
The spectral radius and the distance spectral radius of complements of block graphs
In this paper, we determine the graphs whose spectral radius and distance spectral radius attain maximum and minimum among all complements of clique trees. Furthermore, we also determine the graphs whose spectral radius and distance spectral radius attain minimum and maximum among all complements of block graphs, respectively.
Chen, Xu +3 more
openaire +3 more sources
Advances in Aerodynamics, 2022 In this work, we studied the bluntness effect on the hypersonic boundary-layer transition over a slender cone at Mach 6 with interchangeable tips in a noisy Ludwieg tube tunnel before the so-called “transition reversal” phenomenon occurs.
Ranran Huang +4 more
doaj +1 more source
On spectral radius of the distance matrix
Applicable Analysis and Discrete Mathematics, 2010 We characterize graphs with minimal spectral radius of the distance matrix in three classes of simple connected graphs with n vertices: with fixed vertex connectivity, matching number and chromatic number, respectively.
openaire +3 more sources
On distance spectral radius of uniform hypergraphs [PDF]
Linear and Multilinear Algebra, 2017 The distance spectral radius of a connected hypergraph is the largest eigenvalue of its distance matrix. We determine the unique connected k-uniform hypergraphs with minimum distance spectral radius when the number of pendant edges is given, the unique k-uniform non-hyperstar-like hypertrees (non-hyper-caterpillars, respectively) with minimum distance ...
Hongying Lin, Bo Zhou, Yaduan Li
openaire +1 more source
Inequalities for Distance Signless Laplacian Matrix Under Minimum-Degree Constraints
Journal of MathematicsFor a connected graph G of order n, let DG denote its distance matrix and let TrG be the diagonal matrix formed by the vertex transmissions. The distance signless Laplacian of G is defined by DQ=DG+TrG.
Mohd Abrar Ul Haq, S. Pirzada, Y. Shang
doaj +1 more source
Spectral and Sharp Sufficient Conditions for Graphs to Admit a Strong Star Factor
MathematicsLetGbe a graph. An odd [1,k]-factor of a graph G is a spanning subgraph H of G such that degH(v) is odd and 1⩽degH(v)⩽k for every v∈V(G) where k is a positive odd integer. We call a spanning subgraph H of a graph G a strong star factor if every component
Fengyun Ren, Shumin Zhang, He Li
doaj +1 more source
Nano Select, 2023 Finite‐difference time‐domain (FDTD) simulations of the transmission spectra of planar small‐footprint photonic components with up to four types of morphological disorder as a materials parameter are performed with the aim to identify the individual ...
David Röhlig +3 more
doaj +1 more source
A Novel Algorithm for Initial Cluster Center Selection
IEEE Access, 2019 As one of the most important techniques in data mining, clustering has always been highly concerned. Most clustering algorithms have encountered challenges, such as the difficulty of cluster centers selection, the artificial determination of the number ...
Yating Li +4 more
doaj +1 more source
Directed random geometric graphs: structural and spectral properties
Journal of Physics: Complexity, 2022 In this work we analyze structural and spectral properties of a model of directed random geometric graphs: given n vertices uniformly and independently distributed on the unit square, a directed edge is set between two vertices if their distance is ...
Kevin Peralta-Martinez +1 more
doaj +1 more source
Distance spectral radius and Hamiltonicity of a graph
Proceedings of the National Academy of Sciences of Belarus. Physics and Mathematics Series, 2023 In recent years, the eigenvalues of the distance matrix of a graph have attracted a lot of attention of mathematicians, since there is a close connection between its spectrum and the structural properties of the graph. Thus, quite recently an interesting result was obtained, relating the Hamiltonicity of a graph to the distance spectral radius of the ...
openaire +2 more sources