@article {
author = {Jain, Deepti and Gupta, Purnima},
title = {Graphoidally Independent Infinite Cactus},
journal = {Communications in Combinatorics and Optimization},
volume = {9},
number = {3},
pages = {413-423},
year = {2024},
publisher = {Azarbaijan Shahid Madani University},
issn = {2538-2128},
eissn = {2538-2136},
doi = {10.22049/cco.2022.27745.1338},
abstract = {A graphoidal cover of a graph $G$ (not necessarily finite) is a collection $\psi$ of paths (not necessarily finite, not necessarily open) satisfying the following axioms: (GC-1) Every vertex of $G$ is an internal vertex of at most one path in $\psi$, and (GC-2) every edge of $G$ is in exactly one path in $\psi$. The pair $(G, \psi)$ is called a graphoidally covered graph and the paths in $\psi$ are called the $\psi$-edges of $G$. In a graphoidally covered graph $(G, \psi)$, two distinct vertices $u$ and $v$ are $\psi$-adjacent if they are the ends of an open $\psi$-edge. A graphoidally covered graph $(G, \psi)$ in which no two distinct vertices are $\psi$-adjacent is called $\psi$-independent and the graphoidal cover $\psi$ is called a totally disconnecting graphoidal cover of $G$. Further, a graph possessing a totally disconnecting graphoidal cover is called a graphoidally independent graph. The aim of this paper is to establish complete characterization of graphoidally independent infinite cactus.},
keywords = {Graphoidal Cover of a Graph,Graphoidally Covered Graphs,Graphoidally Independent Graphs,Cactus},
url = {http://comb-opt.azaruniv.ac.ir/article_14473.html},
eprint = {http://comb-opt.azaruniv.ac.ir/article_14473_5e7ec1a2240a429fa913452fe0df7e76.pdf}
}