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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Iiro S. Honkala / rank
Normal rank
 
Property / author
 
Property / author: Antoine C. Lobstein / rank
Normal rank
 
Property / author
 
Property / author: Iiro S. Honkala / rank
 
Normal rank
Property / author
 
Property / author: Antoine C. Lobstein / rank
 
Normal rank
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.3934/amc.2009.3.97 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2094349341 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:10, 19 March 2024

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
    0 references
    10 March 2010
    0 references
    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
    0 references