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.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
EUR 3,43 per la spedizione in U.S.A.
Destinazione, tempi e costiDa: Books Puddle, New York, NY, U.S.A.
Condizione: New. Codice articolo 26386833410
Quantità: 4 disponibili
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Taschenbuch. Condizione: 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. Codice articolo 9786200431394
Quantità: 2 disponibili
Da: Majestic Books, Hounslow, Regno Unito
Condizione: New. Print on Demand. Codice articolo 393815005
Quantità: 4 disponibili
Da: Biblios, Frankfurt am main, HESSE, Germania
Condizione: New. PRINT ON DEMAND. Codice articolo 18386833416
Quantità: 4 disponibili
Da: moluna, Greven, Germania
Condizione: New. Codice articolo 385891431
Quantità: Più di 20 disponibili
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
Taschenbuch. Condizione: 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. Codice articolo 9786200431394
Quantità: 2 disponibili
Da: AHA-BUCH GmbH, Einbeck, Germania
Taschenbuch. Condizione: 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. Codice articolo 9786200431394
Quantità: 1 disponibili