Abstract
A graph G(V, E) with n vertices is said to have modular multiplicative divisor (MMD) labeling if there exist a bijection f:V(G) → {1, 2,…,n} and the induced function f*:E(G) → {0, 1, 2,…,n − 1}where f*(uv) = f(u)f(v)(mod n) for all uv ∊ E(G) such that n divides the sum of all edge labels of G. The graph G is super strongly perfect (SSP) if every induced subgraph H of G contains a minimal dominating set that meets all the maximal cliques of H. This paper investigates some families of SSP bipartite graph structure using MMD labeling.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Gallian, J.A. 2010. A Dynamic Survey of Graph Labeling. The Electronic Journal of Combinatorics 17: #DS6.
Harary, F. 1972. Graph Theory. Reading, MA: Addison-Wesley.
Mary Jeya Jothi, R. 2016. Cyclic Structure of Triangular Grid Graphs Using SSP. International Journal of Pure and Applied Mathematics 109 (9): 46–53.
Revathi, R., and S. Ganesh. 2016. Modular Multiplicative Divisor Labeling of k-Multilevel Corona Related Graphs. Journal of Computational and Theoretical Nanoscience 13: 7634–7639.
Revathi, R., and S. Ganesh. 2017. Characterization of Some Families of Modular Multiplicative Divisor Graphs. Journal of Taibah University for Science 11: 294–297.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
All authors declare that they have no conflict of interest.
Informed consent
Informed consent was obtained from all individual participants included in the study.
Rights and permissions
About this article
Cite this article
Revathi, R., Mary Jeya Jothi, R. Structural behaviour of MMD labeling on some SSP bipartite graphs. J Anal 27, 173–178 (2019). https://doi.org/10.1007/s41478-018-0114-5
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s41478-018-0114-5