Indistinguishable trees and graphs (Q489327)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Indistinguishable trees and graphs
scientific article

    Statements

    Indistinguishable trees and graphs (English)
    0 references
    0 references
    0 references
    20 January 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    non-isomorphic graphs
    0 references
    characteristic polynomial
    0 references
    matchings
    0 references
    independent sets
    0 references
    connected subgraphs
    0 references
    0 references