Computation of mixed resolvability for a circular ladder and its unbounded nature.
Let Γ = Γ(V ,E) be a simple, planar, connected, and undirected graph. The article primarily concentrates on a category of planar graphs, detailing the explicit identification of each member within this graph family. Within the domain of graph theory, the parameters used to uniquely identify vertices...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Public Library of Science (PLoS)
2025-01-01
|
| Series: | PLoS ONE |
| Online Access: | https://doi.org/10.1371/journal.pone.0313788 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|