Existence of independent [1, 2]-sets in caterpillars

Given a graph G, a subset S ⊆ V (G) is an independent [1, 2]-set if no two vertices in S are adjacent and for every vertex ν ∈ V (G)\S, 1 ≤ |N(ν) ∩ S| ≤ 2, that is, every vertex ν ∈ V (G)\S is adjacent to at least one but not more than two vertices in S. In this paper, we discuss the existence of in...

Full description

Saved in:
Bibliographic Details
Main Authors: Santoso, Eko Budi, Marcelo, Reginaldo M
Format: text
Published: Archīum Ateneo 2016
Subjects:
Online Access:https://archium.ateneo.edu/mathematics-faculty-pubs/45
https://aip.scitation.org/doi/abs/10.1063/1.4940820
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Ateneo De Manila University
Be the first to leave a comment!
You must be logged in first