A5101541792- Fluid Dynamics and Vibration Analysis
- Vibration and Dynamic Analysis
- Wind and Air Flow Studies
- Graph theory and applications
- Matrix Theory and Algorithms
- Graph Labeling and Dimension Problems
- Offshore Engineering and Technologies
- Mechanical stress and fatigue analysis
- Tensor decomposition and applications
- Advanced Graph Theory Research
- Aerodynamics and Fluid Dynamics Research
- Interconnection Networks and Systems
- Fluid Dynamics and Turbulent Flows
- Oil and Gas Production Techniques
- Speech Recognition and Synthesis
- Speech and Audio Processing
- Wave and Wind Energy Systems
- Ocean Waves and Remote Sensing
- Coastal and Marine Dynamics
- Civil and Geotechnical Engineering Research
- Oceanographic and Atmospheric Processes
- Structural Integrity and Reliability Analysis
- Geotechnical Engineering and Soil Stabilization
- Fluid Dynamics Simulations and Interactions
- Complex Network Analysis Techniques
Nanjing University of Posts and Telecommunications
2025
Ocean University of China
2013-2024
Southwest University of Science and Technology
2024
South China Normal University
2018-2024
Xi'an University of Architecture and Technology
2016
Beijing Jiaotong University
2008
Xiaomi (China)
2008
For 0 ? 1, Nikiforov proposed to study the spectral properties of family matrices A?(G) = ?D(G)+(1 ?)A(G) a graph G, where D(G) is degree diagonal matrix and A(G) adjacency G. The ?-spectral radius G largest eigenvalue A?(G). with two pendant paths at vertex or adjacent vertices, we prove results concerning behavior under relocation edge in path. We give upper bounds for unicyclic graphs maximum 2, connected irregular given some other parameters, domination number, respectively. determine...
For 0≤α<1 and a uniform hypergraph G, we consider the spectral radius of Aα(G)=αD(G)+(1−α)A(G), which is called α-spectral where D(G) A(G) are diagonal tensor degrees adjacency respectively. We give upper bound for an n-vertex connected irregular k-uniform with 2≤k<n using number vertices, maximum degree diameter.
For 0 ≤ α < 1 and a uniform hypergraph G, the α-spectral radius of G is largest H-eigenvalue αD(G)+(1-α)A(G), where D(G) A(G) are diagonal tensor degrees adjacency respectively.We give upper bounds for hypergraph, propose some transformations that increase radius, determine unique hypergraphs with maximum in classes hypergraphs.
Robustness of the network topology is a key aspect in design computer networks. Vertex (Link, respectively) residual closeness new graph-theoretic concept defined as measure robustness due to failure individual vertices (links, respectively). In this paper, we identify trees and unicyclic graphs with first few smallest vertex closeness, determine that minimize or maximize (link, over some classes graphs.