Inertia of complex unit gain graphs
From MaRDI portal
Publication:1664249
DOI10.1016/j.amc.2015.05.105zbMath1410.05174OpenAlexW638789113MaRDI QIDQ1664249
Guihai Yu, Hui Qu, Jian-hua Tu
Publication date: 24 August 2018
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2015.05.105
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75)
Related Items (max. 100)
Relation between the inertia indices of a complex unit gain graph and those of its underlying graph ⋮ Bounds for the rank of a complex unit gain graph in terms of the independence number ⋮ Complex unit gain bicyclic graphs with rank 2, 3 or 4 ⋮ On the relation between the adjacency rank of a complex unit gain graph and the matching number of its underlying graph ⋮ Complex unit gain graphs of rank 2 ⋮ The rank of a complex unit gain graph in terms of the matching number ⋮ The multiplicity of an \(A_\alpha \)-eigenvalue: a unified approach for mixed graphs and complex unit gain graphs ⋮ On -gain graphs with few positive eigenvalues ⋮ Signed graphs with cut points whose positive inertia indexes are two ⋮ On bounds of \(A_\alpha\)-eigenvalue multiplicity and the rank of a complex unit gain graph ⋮ Inertia indices of a complex unit gain graph in terms of matching number ⋮ On the \({A_{\!\mathbb{C}}}\)-rank of multidigraphs ⋮ The rank of a complex unit gain graph in terms of the rank of its underlying graph ⋮ On connected \(\mathbb{T}\)-gain graphs with rank equal to girth ⋮ Unnamed Item ⋮ More on spectral analysis of signed networks ⋮ Bounds for the rank of a complex unit gain graph in terms of its maximum degree ⋮ A novel method for analyzing inverse problem of topological indices of graphs using competitive agglomeration ⋮ Signed graphs with small positive index of inertia ⋮ GRAPHS DETERMINED BY THEIR -GAIN SPECTRA
Cites Work
- Spectral properties of complex unit gain graphs
- Extremality of degree-based graph entropies
- Probabilistic inequalities for evaluating structural network measures
- Complete solution to a conjecture on the maximal energy of unicyclic graphs
- Biased graphs. I: Bias, balance, and gains
- Connected \((n,m)\)-graphs with minimum and maximum zeroth-order general Randić index
- The inertia of unicyclic graphs and the implications for closed-shells
- Biclique decompositions and Hermitian rank
- Inertia and biclique decompositions of joins of graphs
- Positive and negative inertia index of a graph
- Bicyclic graphs with small positive index of inertia
- A note on distance-based graph entropies
- Graph Energy
- On a conjecture about tricyclic graphs with maximal energy
- Median eigenvalues of bipartite subcubic graphs
- On the nullity of graphs with pendant trees
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Inertia of complex unit gain graphs