On k-graceful, countably infinite graphs (Q1078581): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0012-365x(86)90100-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2083597633 / rank
 
Normal rank

Latest revision as of 09:40, 30 July 2024

scientific article
Language Label Description Also known as
English
On k-graceful, countably infinite graphs
scientific article

    Statements

    On k-graceful, countably infinite graphs (English)
    0 references
    0 references
    1986
    0 references
    Generalizing the concept ''k-graceful graph'' by considering countably infinite graphs instead of finite graphs, the author investigates k- graceful and bijective-k-graceful graphs for each \(k\in {\mathbb{N}}\). Similarly to his paper with the title ''Problems in graph theory: Graceful and sequential numberings of infinite graphs'' published in Southeast. Asian Bull. Math. 9, 15-22 (1985; Zbl 0589.05057), he determines some classes of k-graceful and bijective-k-graceful graphs, presents several sufficient conditions for graphs to be k-graceful or bijective-k- graceful, and finally shows a relation between k-gracefulness of countably infinite graphs and certain problems of number theory.
    0 references
    0 references
    labeling graphs
    0 references
    graph labeling
    0 references
    numbering graphs
    0 references
    graph numbering
    0 references
    bijective-k-graceful graphs
    0 references
    0 references