(2,1)-total labeling of a class of subcubic graphs

DOI10.1016/J.ENDM.2015.05.039zbMATH Open1347.05222OpenAlexW778216901MaRDI QIDQ324977FDOQ324977

A. Velankanni, G. Sethuraman

Publication date: 17 October 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2015.05.039

Recommendations

• (2,1)-total labeling of cube connected cycle
• The \((2,1)\)-total labeling number of outerplanar graphs is at most \(\Delta + 2\)
• The maximum degree and \((p,1)\)-total labeling of graphs
• \((p,1)\)-total labelling of graphs
• scientific article

zbMATH Keywords

subcubic graphs\((2,1)\)-total labelingHavet and Yu conjecture

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• Labelling Graphs with a Condition at Distance 2
• A survey on labeling graphs with a condition at distance two
• \((d,1)\)-total labelling of planar graphs with large girth and high maximum degree
• \((2,1)\)-total labelling of outerplanar graphs
• \((p,1)\)-total labelling of graphs
• (d,1)-total labeling of graphs with a given maximum average degree
• The \((p,q)\)-total labeling problem for trees
• (2,1)-total number of joins of paths and cycles
• A tight upper bound on the (\(2,1\))-total labeling number of outerplanar graphs
• On the $\lambda$-Number of $Q_n $ and Related Graphs
• Complexity of (p,1)-total labelling

Cited In (5)

• \( L ( p , q )\)-labelings of subdivisions of graphs
• Facial \([r,s,t]\)-colorings of plane graphs
• \(L(2,1)\)-labelings of subdivisions of graphs
• \(L(2,1)\)-labeling for subdivisions of cycle dominated graphs
• Title not available (Why is that?)

This page was built for publication: \((2,1)\)-total labeling of a class of subcubic graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q324977)