Graceful labeling for mushroom trees (Q2350272): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4208427 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4820534 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Edge-magic group labellings of countable graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Graceful tree conjecture for infinite trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5480714 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5170006 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Vertex domination‐critical graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A dynamic survey of graph labeling / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: All trees of diameter five are graceful / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3663322 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4401957 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A complete solution to the two-table Oberwolfach problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4075486 / rank | |||
Normal rank |
Latest revision as of 06:57, 10 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Graceful labeling for mushroom trees |
scientific article |
Statements
Graceful labeling for mushroom trees (English)
0 references
19 June 2015
0 references
A graceful labelling of a graph \(G=(V(G),E(G))\) on \(n\) vertices is a mapping \(f:V(G)@>>>\{0,1,\dots,n\}\) such that the mapping with \(\{x,y\}\mapsto |f(x)-f(y)|\) is injective on the set of edges of \( G\). The authors prove that if \(T\) is a tree of order \(k+1\) and \(S\) is a star with at least \((e^{4/e})^k\) leaves then any graph obtained from the disjoint union of \(T\) and \(S\) by an identification of a vertex \(x\in V(T)\) with the center of \(S\) is a graceful tree.
0 references
graceful labelling
0 references
amalgamation
0 references