Edge number, minimum degree, maximum independent set, radius and diameter in twin-free graphs (Q2268243)

From MaRDI portal
Revision as of 21:10, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Edge number, minimum degree, maximum independent set, radius and diameter in twin-free graphs
scientific article

    Statements

    Edge number, minimum degree, maximum independent set, radius and diameter in twin-free graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    10 March 2010
    0 references
    graph theory
    0 references
    identifying code
    0 references
    twins
    0 references
    twin-free graph
    0 references
    identifiable graph
    0 references
    minimum degree
    0 references
    maximum independent set
    0 references
    maximum stable set
    0 references
    radius
    0 references
    diameter
    0 references

    Identifiers