Items related to Neighbourhood graph of a graph and its Excellence
Synopsis
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.
"synopsis" may belong to another edition of this title.
Search results for Neighbourhood graph of a graph and its Excellence
Stock Image
Neighbourhood graph of a graph and its Excellence
Published by
LAP LAMBERT Academic Publishing, 2019
ISBN 10: 6200431396
ISBN 13: 9786200431394
New
Softcover
Seller: Books Puddle, New York, NY, U.S.A.
Seller rating 4 out of 5 stars
Condition: New. Seller Inventory # 26386833410
Quantity: 4 available
Stock Image
Neighbourhood graph of a graph and its Excellence
Published by
LAP LAMBERT Academic Publishing, 2019
ISBN 10: 6200431396
ISBN 13: 9786200431394
New
Softcover
Seller: Majestic Books, Hounslow, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. Print on Demand. Seller Inventory # 393815005
Quantity: 4 available
Seller Image
Neighbourhood graph of a graph and its Excellence
Published by
LAP LAMBERT Academic Publishing Sep 2019, 2019
ISBN 10: 6200431396
ISBN 13: 9786200431394
New
Taschenbuch
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 72 pp. Englisch. Seller Inventory # 9786200431394
Quantity: 2 available
Stock Image
Neighbourhood graph of a graph and its Excellence
Published by
LAP LAMBERT Academic Publishing, 2019
ISBN 10: 6200431396
ISBN 13: 9786200431394
New
Softcover
Seller: Biblios, Frankfurt am main, HESSE, Germany
Seller rating 5 out of 5 stars
Condition: New. PRINT ON DEMAND. Seller Inventory # 18386833416
Quantity: 4 available
Seller Image
Neighbourhood graph of a graph and its Excellence
Published by
LAP LAMBERT Academic Publishing, 2019
ISBN 10: 6200431396
ISBN 13: 9786200431394
New
Softcover
Seller: moluna, Greven, Germany
Seller rating 4 out of 5 stars
Condition: New. Seller Inventory # 385891431
Quantity: Over 20 available
Seller Image
Neighbourhood graph of a graph and its Excellence
Published by
LAP LAMBERT Academic Publishing Sep 2019, 2019
ISBN 10: 6200431396
ISBN 13: 9786200431394
New
Taschenbuch
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. Neuware -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.Books on Demand GmbH, Überseering 33, 22297 Hamburg 72 pp. Englisch. Seller Inventory # 9786200431394
Quantity: 2 available
Seller Image
Neighbourhood graph of a graph and its Excellence
Published by
LAP LAMBERT Academic Publishing, 2019
ISBN 10: 6200431396
ISBN 13: 9786200431394
New
Taschenbuch
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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. Seller Inventory # 9786200431394
Quantity: 1 available