Some Parameters on Neighborhood Number of A Graph

DOI10.1016/J.ENDM.2009.03.020zbMath1267.05187OpenAlexW1987351387MaRDI QIDQ2839257

B. Chaluvaraju

Publication date: 4 July 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2009.03.020

zbMATH Keywords

graphneighborhood setneighborhood number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

On the complexity of the independent set problem in triangle graphs ⋮ Unnamed Item

Cites Work

• The neighbourhood number of a graph
• The independent neighbourhood number of a graph
• Paired-domination in graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Some Parameters on Neighborhood Number of A Graph