arXiv (All)
open access
Connected Mutual-Visibility in Graphs
A set $S$ of vertices of a graph $G$ is a connected mutual-visibility set if every two vertices of $S$ are joined by a shortest path whose internal vertices lie outside $S$, and the subgraph induced by $S$ is connected. We introduce the connected mutual-visibility number $μ_c(G)$, defined as the max
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
- Rainbow paths in directed graphs#974805
- Revealed Social Networks#665469
- Revealed Social Networks#663969
- A rainbow partition theorem for trees and connected maximin share allocations of chores#1143229
- Subquadratic Subsidies for Nonnegative or Nonpositive Valuations#985643
Record · ID 1013034
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