\((p,q)\)-total labeling of complete graphs

DOI10.1007/S10878-012-9471-1zbMath1294.90065OpenAlexW2080133845MaRDI QIDQ1956251

Yanyan Li

Publication date: 13 June 2013

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-012-9471-1

zbMATH Keywords

matchingcomplete graph\(L(2,1)\)-labeling\((p,q)\)-total labeling

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items (1)

\(L(d,1)\)-labelings of the edge-path-replacement by factorization of graphs

Cites Work

• Unnamed Item
• List edge and list total colourings of multigraphs
• \((2,1)\)-total labelling of outerplanar graphs
• \((p,1)\)-total labelling of graphs
• A survey on labeling graphs with a condition at distance two
• (d,1)-total labeling of graphs with a given maximum average degree
• Labelling Graphs with a Condition at Distance 2
• On the $\lambda$-Number of $Q_n $ and Related Graphs

This page was built for publication: \((p,q)\)-total labeling of complete graphs