| Neighbourhood graph of a graph and its Excellence Contributor(s): Gurusamy, G. Jothilakshmi (Author), Ponpandian, Pushpalatha (Author), Banu, Nasreen (Author) |
|
 |
ISBN: 6200431396 ISBN-13: 9786200431394 Publisher: LAP Lambert Academic Publishing OUR PRICE: $33.75 Product Type: Paperback Published: September 2019 |
| Additional Information |
| BISAC Categories: - Mathematics |
| Physical Information: 0.17" H x 6" W x 9" (0.26 lbs) 72 pages |
| Descriptions, Reviews, Etc. |
| Publisher Description: Claude Berge in 1980 introduced B-graphs. There are graphs in which every vertex in the graph is contained in a maximum independent set of the graph. Fricke et al in 2002 made a beginning of the study of graphs which are excellent with respect to various graph parameters. A graph is neighbourhood excellent if every vertex in the graph is contained in a neighbourhood set. Given a graph, a new graph can be constructed by using neighbourhood sets of G. The vertices of the new graph are of course the neighbourgood sets of G and two such vertices will be adjacent if in the corresponding neighborhood sets, one can move from one of them to other by deletion of a vertex and addition of another vertex. This book is devoted to the study of Neighbourhood graph of a graph and its Excellence. |