Structural behaviour of MMD labeling on some SSP bipartite graphs

DOI10.1007/s41478-018-0114-5zbMath1409.05179OpenAlexW2810470528MaRDI QIDQ1740213

R. Revathi, R. Mary Jeya Jothi

Publication date: 29 April 2019

Published in: The Journal of Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s41478-018-0114-5

zbMATH Keywords

SSPdecompositionbipartite graphminimal dominating setMMD labeling

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

MMD labeling of EASS of Jewel graph

Cites Work

• A dynamic survey of graph labeling
• The Two-Triangle Case of the Acquaintance Graph

This page was built for publication: Structural behaviour of MMD labeling on some SSP bipartite graphs