Some mixed graphs with \(H\)-rank 4, 6 or 8 (Q2025060): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1007/s10878-021-00704-6 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Graphs and matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of graphs with rank 4 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of graphs with rank 5 / 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: Relation between the \(H\)-rank of a mixed graph and the rank of its underlying graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spektren endlicher Grafen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relationship between the rank and the matching number of a graph / 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: Digraphs with Hermitian spectral radius below 2 and their cospectrality with paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2867619 / 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: 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: Skew-rank of an oriented graph and independence 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: Bicyclic oriented graphs with skew-rank 6 / 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 signed graph in terms of the rank of its underlying graph / 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: On the relationship between the skew-rank of an oriented graph and the rank of its underlying graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hermitian adjacency spectrum and switching equivalence of mixed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bicyclic oriented graphs with skew-rank 2 or 4 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum rank of matrices and the equivalence class graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of singular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed graphs with \(H\)-rank 3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound of the nullity of a graph in terms of order and maximum degree / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10878-021-00704-6 / rank
 
Normal rank

Latest revision as of 19:25, 16 December 2024

scientific article
Language Label Description Also known as
English
Some mixed graphs with \(H\)-rank 4, 6 or 8
scientific article

    Statements

    Some mixed graphs with \(H\)-rank 4, 6 or 8 (English)
    0 references
    0 references
    0 references
    0 references
    11 May 2021
    0 references
    \(H\)-rank
    0 references
    switching equivalence
    0 references
    mixed bipartite graph
    0 references
    0 references
    0 references

    Identifiers