Los puntos clave no están disponibles para este artículo en este momento.
Based on the Hermitian adjacency matrices of second kind introduced by Mohar 1 and weighted adjacency matrices introduced in 2, we define a kind of index weighted Hermitian adjacency matrices of mixed graphs. In this paper we characterize the structure of mixed graphs which are cospectral to their underlying graphs, then we determine a upper bound on the spectral radius of mixed graphs with maximum degree Δ , and characterize the corresponding extremal graphs.
Building similarity graph...
Analyzing shared references across papers
Loading...
Wang et al. (Sun,) studied this question.
synapsesocial.com/papers/68e718f5b6db6435876928c8 — DOI: https://doi.org/10.61091/um119-07
Zheng Wang
Anhui Jianzhu University
Tao She
Chunxiang Wang
Central China Normal University
Utilitas Mathematica
Central China Normal University
Building similarity graph...
Analyzing shared references across papers
Loading...
Synapse has enriched 3 closely related papers on similar clinical questions. Consider them for comparative context: