MMD labeling of EASS of Cartesian product of two graphs
From MaRDI portal
Cites work
Cited in
(4)- Structural behaviour of MMD labeling on some SSP bipartite graphs
- An algorithmic framework for optimizing acyclic matching in corona graphs
- Exploring modular multiplicative divisor labeling to expand graph families
- Covering and domination equivalence in ISC networks using arbitrary super subdivisions of corona graphs
This page was built for publication: MMD labeling of EASS of Cartesian product of two graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6059857)