Strongly indexable graphs (Q1182885): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3313904 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3892270 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3960885 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4044627 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sequential labelings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel concepts in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5589124 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On k-sequential and other numbered graphs / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0012-365x(91)90248-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1965901890 / rank
 
Normal rank

Latest revision as of 11:59, 30 July 2024

scientific article
Language Label Description Also known as
English
Strongly indexable graphs
scientific article

    Statements

    Strongly indexable graphs (English)
    0 references
    0 references
    28 June 1992
    0 references
    The authors introduce a new kind of vertex labeling of graphs by defining the concept of indexable and strongly \(k\)-indexable graphs. After showing the relation of these new notions to other known vertex labelings of graphs like strongly \(k\)-elegant or strongly \(k\)-harmonious labelings they prove some necessary conditions, determine a few simple classes of indexable or strongly \(k\)-indexable graphs, and conclude by giving two general results.
    0 references
    0 references
    vertex labeling
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references