Bounds for the rank of a complex unit gain graph in terms of the independence number (Q5073035): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3025324169 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1909.08533 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral properties of complex unit gain graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inertia of complex unit gain graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the determinant of the Laplacian matrix of a complex unit gain graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complex unit gain bicyclic graphs with rank 2, 3 or 4 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The rank of a complex unit gain graph in terms of the rank of its underlying graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large regular bipartite graphs with median eigenvalue 1 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the nullity of line graphs of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The rank of a graph after vertex addition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Skew-rank of an oriented graph in terms of matching number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nullity of a graph in terms of the dimension of cycle space and the number of pendant vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the nullity of unicyclic signed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the independence number of a graph in terms of order and size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjacency rank and independence number of a signed graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The relation between the <i>H</i>-rank of a mixed graph and the independence number of its underlying graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relation between the skew-rank of an oriented graph and the independence number of its underlying graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for the matching number and cyclomatic number of a signed graph in terms of rank / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Laplacian Eigenvalues of Signed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Signed graphs with cut points whose positive inertia indexes are two / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the relation between the<i>H</i>-rank of a mixed graph and the matching number of its underlying graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hermitian-adjacency matrices and Hermitian energies of mixed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hermitian adjacency spectrum and switching equivalence of mixed graphs / rank
 
Normal rank

Latest revision as of 21:04, 28 July 2024

scientific article; zbMATH DE number 7518421
Language Label Description Also known as
English
Bounds for the rank of a complex unit gain graph in terms of the independence number
scientific article; zbMATH DE number 7518421

    Statements

    Bounds for the rank of a complex unit gain graph in terms of the independence number (English)
    0 references
    0 references
    0 references
    0 references
    5 May 2022
    0 references
    complex unit gain graph
    0 references
    rank
    0 references
    independence number
    0 references
    cyclomatic number
    0 references
    0 references

    Identifiers