A new sufficient condition for a tree T to have the (2,1)-total number +1
From MaRDI portal
Publication:2359803
Recommendations
- A sufficient condition for a tree to be \((\Delta+1)\)-\((2,1)\)-totally labelable
- scientific article; zbMATH DE number 1161337
- scientific article; zbMATH DE number 5370876
- scientific article; zbMATH DE number 1932300
- Some new formulae on \(\Delta \)-optimum exclusive sum labeling of certain trees
- A new proof of Cayley's formula for counting labeled trees
- On the (2,2)-domination number of trees
- A sufficient condition for a graph to have a k-tree
- A characterization of trees for a new lower bound on the k-independence number
- A new lower bound for the irredundance number of a tree
Cites work
- $L(2,1)$-Labeling of Hamiltonian graphs with Maximum Degree 3
- (2,1)-total labelling of trees with sparse vertices of maximum degree
- (d,1)-total labeling of graphs with a given maximum average degree
- A bound on the chromatic number of the square of a planar graph
- A sufficient condition for a tree to be \((\Delta+1)\)-\((2,1)\)-totally labelable
- A tight upper bound on the (\(2,1\))-total labeling number of outerplanar graphs
- Labeling Planar Graphs with Conditions on Girth and Distance Two
- Labelling Graphs with a Condition at Distance 2
- On \((d,1)\)-total numbers of graphs
- On the $\lambda$-Number of $Q_n $ and Related Graphs
- The $L(2,1)$-Labeling Problem on Graphs
- The (p,q)-total labeling problem for trees
- The L(2,1)-labelling of trees
- \((2,1)\)-Total number of trees with maximum degree three
- \((2,1)\)-total labeling of trees with large maximum degree
- \((2,1)\)-total labelling of outerplanar graphs
- (d,1)-total labellings of regular nonbipartite graphs and an application to flower snarks.
- \((p,1)\)-total labelling of graphs
- \([r,s,t]\)-colorings of graphs
Cited in
(6)- scientific article; zbMATH DE number 1161337 (Why is no real title available?)
- (2,1)-total labelling of trees with sparse vertices of maximum degree
- \((2,1)\)-Total number of trees with maximum degree three
- A sufficient condition for a tree to be \((\Delta+1)\)-\((2,1)\)-totally labelable
- \((2,1)\)-total labeling of trees with large maximum degree
- scientific article; zbMATH DE number 1932300 (Why is no real title available?)
This page was built for publication: A new sufficient condition for a tree \(T\) to have the \((2,1)\)-total number \(\Delta +1\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2359803)
