Partial domination of middle graphs
Preprint
Abstract
For any graph $G=(V,E)$, a subset $S\subseteq V$ is called {\it an isolating set} of $G$ if $V\setminus N_G[S]$ is an independent set of $G$, where $N_G[S]=S\cup N_G(S)$, and {\it the isolation number} of $G$, denoted by $ι(G)$, is the size of a smallest isolating set of $G$. In this article, we show that the isolation number of the middle graph of $G$ is equal to the size of a smallest maximal matching of $G$.
Keywords
All Related Versions
This publication has 9 references indexed in Scilit:
- Extensions of the Art Gallery TheoremAnnals of Combinatorics, 2022
- Isolation of k-cliques IIDiscrete Mathematics, 2022
- Isolation Number versus Domination Number of TreesMathematics, 2021
- Isolation number of maximal outerplanar graphsDiscrete Applied Mathematics, 2019
- Partial domination - the isolation number of a graphFilomat, 2017
- Hamiltonicity of complements of middle graphsDiscrete Mathematics, 2007
- Randomly matchable graphsJournal of Graph Theory, 1979
- Properties of Hereditary Hypergraphs and Middle GraphsCanadian Mathematical Bulletin, 1978
- Traversability and connectivity of the middle graph of a graphDiscrete Mathematics, 1976