The neighbourhood number of a graph
From MaRDI portal
Publication:1057885
zbMath0564.05052MaRDI QIDQ1057885
E. Sampathkumar, Prabha S. Neeralagi
Publication date: 1985
Published in: Indian Journal of Pure \& Applied Mathematics (Search for Journal in Brave)
independence numberwheeldomination numberline covering numberneighbourhood numberpoint covering number
Related Items (14)
On Co-completek–partite Graph Valued Functions ⋮ THE CONNECTED NEIGHBOURHOOD POLYNOMIAL OF CORONA OF GRAPHS ⋮ Algorithmic aspects of the generalized clique-transversal problem on chordal graphs ⋮ NP-completeness of the independent dominating set problem in the class of cubic planar bipartite graphs ⋮ Neighborhood covering and independence on \(P_4\)-tidy graphs and tree-cographs ⋮ Improper C-colorings of graphs ⋮ Vertex coloring without large polychromatic stars ⋮ Some Parameters on Neighborhood Number of A Graph ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On classes of neighborhood resolving sets of a graph ⋮ Independent Domination in Triangle Graphs ⋮ Bibliography on domination in graphs and some basic definitions of domination parameters ⋮ 1-Triangle graphs and perfect neighborhood sets
This page was built for publication: The neighbourhood number of a graph
