Metraipolis › archive › dc_5b591242e675
On the Independence Number of the Modular Product — arXiv:2608.03352
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.03352
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-31T12:55:49.077Z
- SHA-256 of the archived text
9faa68b0a263ffced9faf06af93c794a76f7235ee6d694844d9d5e192d7b7e5a- Stable URL of this page
https://metraipolis.com/documento/dc_5b591242e675
How to cite
On the Independence Number of the Modular Product — arXiv:2608.03352 — arXiv (en), https://arxiv.org/abs/2608.03352 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_5b591242e675 (Metraipolis archive dc_5b591242e675, sha256 9faa68b0a263ffced9faf06af93c794a76f7235ee6d694844d9d5e192d7b7e5a)
BibTeX
@misc{dc5b591242e675,
title = {On the Independence Number of the Modular Product — arXiv:2608.03352},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.03352},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_5b591242e675; sha256 9faa68b0a263ffced9faf06af93c794a76f7235ee6d694844d9d5e192d7b7e5a},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.03352. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
The \emph{modular product} $G\diamond H$ of graphs $G$ and $H$ is a graph on vertex set $V(G)\times V(H)$. Two vertices $(g,h)$ and $(g',h')$ of $G\diamond H$ are adjacent if $g=g'$ and $hh'\in E(H)$, or $gg'\in E(G)$ and $h=h'$, or $gg'\in E(G)$ and $hh'\in E(H)$, or (for $g\neq g'$ and $h\neq h'$) $gg'\notin E(G)$ and $hh'\notin E(H)$. The independence number $\alpha(G)$ of a graph $G$ is the maximum cardinality of a set of pairwise nonadjacent vertices in $G$. In this paper, we study the independence number of the modular product of graphs. We first structurally characterize all independent set of $G\diamond H$ which lead to the exact result on $\alpha(G \diamond H)$. Special cases of this result lead to several sharp bounds and some exact results for $\alpha(G \diamond H)$. Finally, we introduce a partition graph associated with $G \diamond H$ that provides a framework for constructing independent sets of the modular product from independent sets of its substructures.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-05 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2608.03352 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-31T12:42:47.771Z dalla pagina https://arxiv.org/catchup/math.CO/2026-08-05?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).