Graphs whose adjacency matrices have rank equal to the number of distinct nonzero rows (Q389670): Difference between revisions

From MaRDI portal
Importer (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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.laa.2012.06.027 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2020746988 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The neighborhood inclusion structure of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the rank of a cograph / 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: Theorems on partitioned matrices revisited and their applications to graph spectra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2785496 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828550 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4286076 / 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: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: The rank of a cograph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph derivatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unoriented Laplacian maximizing graphs are degree maximal / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 05:53, 7 July 2024

scientific article
Language Label Description Also known as
English
Graphs whose adjacency matrices have rank equal to the number of distinct nonzero rows
scientific article

    Statements

    Graphs whose adjacency matrices have rank equal to the number of distinct nonzero rows (English)
    0 references
    0 references
    0 references
    0 references
    21 January 2014
    0 references
    rank
    0 references
    adjacency matrix
    0 references
    reduced adjacency matrix
    0 references
    reduced graph
    0 references
    number of distinct nonzero rows
    0 references
    cograph
    0 references
    neighborhood equivalence classes
    0 references

    Identifiers