New perspectives on classical meanness of some ladder graphs

DOI10.1155/2021/9926350MaRDI QIDQ2240206zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 8 November 2021

Published in Journal of Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2021/9926350

Mathematics Subject Classification ID

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

Review text

Summary: In this study, we investigate a new kind of mean labeling of graph. The ladder graph plays an important role in the area of communication networks, coding theory, and transportation engineering. Also, we found interesting new results corresponding to classical mean labeling for some ladder-related graphs and corona of ladder graphs with suitable examples.

Recommendations

• Logarithmic mean labeling of some ladder related graphs
• New classes of mean graphs
• Some new families of mean graphs
• Mean labeling of graphs obtained by identifying two graphs
• Mean labelings of graphs

Cites work

• A mathematical approach on representation of competitions: competition cluster hypergraphs
• Crown graphs and subdivision of ladders are odd graceful
• Edge \(\delta\)-graceful labeling for some cyclic-related graphs
• Edge even graceful labeling of cylinder grid graph
• Further results on edge - odd graceful graphs
• scientific article; zbMATH DE number 6506585 (Why is no real title available?)
• scientific article; zbMATH DE number 3458691 (Why is no real title available?)
• scientific article; zbMATH DE number 1270594 (Why is no real title available?)
• scientific article; zbMATH DE number 194437 (Why is no real title available?)
• scientific article; zbMATH DE number 6937960 (Why is no real title available?)
• scientific article; zbMATH DE number 5242079 (Why is no real title available?)
• scientific article; zbMATH DE number 3308125 (Why is no real title available?)
• Logarithmic mean labeling of some ladder related graphs
• Mean labelings of graphs
• On \(H\)-irregularity strength of ladders and fan graphs
• Preservation of the classical meanness property of some graphs based on line graph operation
• Radio labeling of some ladder-related graphs
• Reinforcement number of a graph with respect to half-domination
• Total edge irregularity strength of ladder-related graphs

Cited in

(3)

• Preservation of the classical meanness property of some graphs based on line graph operation
• Logarithmic mean labeling of some ladder related graphs
• Implementation of classical mean assignment techniques in triangular and quadrilateral snake graphs

This page was built for publication: New perspectives on classical meanness of some ladder graphs

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