Inertia of complex unit gain graphs

DOI10.1016/J.AMC.2015.05.105MaRDI QIDQ1664249zbMATH OpenOpenAlexFDO

Authors Guihai Yu, Hui Qu, Jianhua 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

zbMATH Keywords

treeinertiaunicyclic graphcomplex unit gain graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75)

Recommendations

• Relation between the inertia indices of a complex unit gain graph and those of its underlying graph
• Relations between the positive inertia index of a \(\mathbb{T}\)-gain graph and that of its underlying graph
• Complex unit gain graphs of rank 2
• Inertia indices of a complex unit gain graph in terms of matching number
• Complex unit gain bicyclic graphs with rank 2, 3 or 4

Cites work

• scientific article; zbMATH DE number 6704583 (Why is no real title available?)
• scientific article; zbMATH DE number 6704610 (Why is no real title available?)
• scientific article; zbMATH DE number 6704637 (Why is no real title available?)
• scientific article; zbMATH DE number 6282144 (Why is no real title available?)
• scientific article; zbMATH DE number 6282174 (Why is no real title available?)
• scientific article; zbMATH DE number 5259316 (Why is no real title available?)
• scientific article; zbMATH DE number 3414355 (Why is no real title available?)
• A note on distance-based graph entropies
• A survey on graphs extremal with respect to distance-based topological indices
• Biased graphs. I: Bias, balance, and gains
• Biclique decompositions and Hermitian rank
• Bicyclic graphs with small positive index of inertia
• Complete solution to a conjecture on the maximal energy of unicyclic graphs
• Connected \((n,m)\)-graphs with minimum and maximum zeroth-order general Randić index
• Degree Kirchhoff index of unicyclic graphs
• Disproving a conjecture on trees with minimal atom-bond connectivity index
• Extremal matching energy of bicyclic graphs
• Extremality of degree-based graph entropies
• Graph energy
• Inertia and biclique decompositions of joins of graphs
• Median eigenvalues of bipartite planar graphs
• Note on the HOMO-LUMO index of graphs
• On Wiener index of common neighborhood graphs
• On a conjecture about tricyclic graphs with maximal energy
• On connective eccentricity index of graphs
• On incidence energy
• On the nullity of graphs with pendant trees
• Positive and negative inertia index of a graph
• Probabilistic inequalities for evaluating structural network measures
• Spectral properties of complex unit gain graphs
• The Wiener polarity index of graph products.
• The inertia of unicyclic graphs and the implications for closed-shells
• Vertex-degree-based topological indices over graphs

Cited in

(26)

• Relations between the positive inertia index of a \(\mathbb{T}\)-gain graph and that of its underlying graph
• On the adjacency matrix of a complex unit gain graph
• More on spectral analysis of signed networks
• A novel method for analyzing inverse problem of topological indices of graphs using competitive agglomeration
• The rank of a complex unit gain graph in terms of the matching number
• Bounds for the rank of a complex unit gain graph in terms of its maximum degree
• Gain distance matrices for complex unit gain graphs
• Eigenvalues of complex unit gain graphs and gain regularity
• Relation between the inertia indices of a complex unit gain graph and those of its underlying graph
• The multiplicity of an \(A_\alpha \)-eigenvalue: a unified approach for mixed graphs and complex unit gain graphs
• Complex unit gain graphs of rank 2
• Complex unit gain bicyclic graphs with rank 2, 3 or 4
• The gap between the rank of a complex unit gain graph and its underlying graph
• The rank of a complex unit gain graph in terms of the rank of its underlying graph
• On -gain graphs with few positive eigenvalues
• Bounds of nullity for complex unit gain graphs
• On the relation between the adjacency rank of a complex unit gain graph and the matching number of its underlying graph
• scientific article; zbMATH DE number 7692350 (Why is no real title available?)
• On connected \(\mathbb{T}\)-gain graphs with rank equal to girth
• Graphs determined by their \(T\)-gain spectra
• 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
• Bounds for the rank of a complex unit gain graph in terms of the independence number
• On the \({A_{\!\mathbb{C}}}\)-rank of multidigraphs
• Signed graphs with small positive index of inertia

This page was built for publication: Inertia of complex unit gain graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1664249)