The (2,1)-total labeling of graphs with low maximum average degree

DOI10.11778/J.JDXB.2014.05.016MaRDI QIDQ5260669zbMATH OpenFDO

Authors Xinyue Liu, Lei Sun

Publication date 29 June 2015

zbMATH Keywords

connected graphmaximum average degree(2,1)-total labeling

Mathematics Subject Classification ID

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

Recommendations

• (d,1)-total labeling of graphs with a given maximum average degree
• The maximum degree and \((p,1)\)-total labeling of graphs
• \((2,1)\)-total labeling of planar graphs with large girth and low maximum degree.
• \((2,1)\)-total labeling of trees with large maximum degree
• \((2,1)\)-Total number of trees with maximum degree three

Cited in

(1)

• (d,1)-total labeling of graphs with a given maximum average degree

This page was built for publication: The (2,1)-total labeling of graphs with low maximum average degree

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