Strongly indexable graphs (Q1182885): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
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 |
Revision as of 15:33, 15 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Strongly indexable graphs |
scientific article |
Statements
Strongly indexable graphs (English)
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
vertex labeling
0 references