arXiv (All)
open access
Vertices that belong to every minimum dominating set of a graph and their connection with transportation sharing systems with study cases in Campo de Gibraltar area
This study addresses a theoretical model regarding equity and accessibility challenges in designing shared transportation systems (such as micro-mobility networks) by applying graph-vertex domination setting. The work focuses on identifying dominating forced vertices, that represent nodes belonging
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Further results on \([k]\)-Roman domination on cylindrical grids \(C_m \Box P_n\)#1076842
- In solving the dominating set problem : group theory approach#1020688
- Majority C-coloring in Cartesian products#780968
- Majority C-coloring in Cartesian products#779593
- The game chromatic number of generalized Mycielski graphs of paths and cycles#924181
Record · ID 1115774
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive