Neighbourhood sets in graphs

zbMATH Open0733.05074MaRDI QIDQ810065FDOQ810065

Authors: S. R. Jayaram, Y. H. Harris Kwong, H. Joseph Straight 

Publication date: 1991

Published in: Indian Journal of Pure \& Applied Mathematics (Search for Journal in Brave)

Recommendations

• The neighbourhood number of a graph
• scientific article; zbMATH DE number 969982
• On neighborhood graphs: domination, coloring and other properties
• Publication:3487418
• The independent neighbourhood number of a graph

zbMATH Keywords

domination numberintersection graphcovering numbersvertex partitionneighbourhood set

Mathematics Subject Classification ID

Graph theory (05C99)

Cited In (24)

• Nearest-neighbor graphs on the cantor set
• The nomatic number problem in interval graphs
• On minimal neighbourhood-connected graphs
• Just \(\mathrm{nr}\)-excellent graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Minimum line-neighbourhood set of an interval graph -- a linear time algorithm
• Title not available (Why is that?)
• On neighborhood graphs: domination, coloring and other properties
• Neighborhoods in problems of discrete mathematics
• Title not available (Why is that?)
• Graphs with special neighbourhood orderings of vertices
• Title not available (Why is that?)
• Neighbourhood resolving sets in graphs. II
• Title not available (Why is that?)
• On classes of neighborhood resolving sets of a graph
• Title not available (Why is that?)
• Neighborhood representatives
• Title not available (Why is that?)
• Title not available (Why is that?)
• Global neighbourhood in graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Neighborhood perfect graphs

This page was built for publication: Neighbourhood sets in graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q810065)