Radio numbers of certain \(m\)-distant trees (Q2018964): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q2765170 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4665539 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Linear and cyclic radio k-labelings of trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Radio number for trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Multilevel Distance Labelings for Paths and Cycles / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A survey on radio \(k\)-colorings of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An improved lower bound for the radio \(k\)-chromatic number of the hypercube qn / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5461564 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optimal radio labellings of complete \(m\)-ary trees / rank | |||
Normal rank |
Latest revision as of 22:19, 9 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Radio numbers of certain \(m\)-distant trees |
scientific article |
Statements
Radio numbers of certain \(m\)-distant trees (English)
0 references
26 March 2015
0 references
Summary: Radio coloring of a graph \(G\) with diameter \(d\) is an assignment \(f\) of positive integers to the vertices of \(G\) such that \(|f(u)-f(v)|\geq 1+d-d(u,v)\), where \(u\) and \(v\) are any two distinct vertices of \(G\) and \(d(u,v)\) is the distance between \(u\) and \(v\). The number \(\max\{f(u): u\in V(G)\}\) is called the span of \(f\). The minimum of spans over all radio colorings of \(G\) is called radio number of \(G\), denoted by \(rn(G)\). An \(m\)-distant tree \(T\) is a tree in which there is a path \(P\) of maximum length such that every vertex in \(V(T)\setminus V(P)\) is at the most distance \(m\) from \(P\). This path \(P\) is called a central path. For every tree \(T\), there is an integer \(m\) such that \(T\) is an \(m\)-distant tree. In this paper, we determine the radio number of some \(m\)-distant trees for any positive integer \(m\geq 2\), and as a consequence of it, we find the radio number of a class of 1-distant trees (or caterpillars).
0 references
radio coloring
0 references
caterpillars
0 references
radio number
0 references