Gurusamy Jothilakshmi (11 results)

Condition: New.

Condition: New.

Taschenbuch. Condition: Neu. Neighbourhood graph of a graph and its Excellence | G. Jothilakshmi Gurusamy (u. a.) | Taschenbuch | 72 S. | Englisch | 2019 | LAP LAMBERT Academic Publishing | EAN 9786200431394 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu.…

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.…

Condition: New. Print on Demand.

Condition: New. PRINT ON DEMAND.

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.…

Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Ponnupandian A .P. PushpalathaDr. A. P. Pushpalatha, an Indian is currently working at Thiagarajar College of Engineering, Madurai. She is a 24 year experienced Mathematician with extensive knowledge in Graph Theory. Some of her note.…

Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Gurusamy G.JothilakshmiDr.Jothilaksmi Gurusamy, an Indian is currently working at Thiagarajar College of Engineering, Madurai. She is a 25 year experienced mathematician with extensive knowledge in Graph Theory. Some of here notewor.…

Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. 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.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 72 pp. Englisch.…

Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -This book contains application to surveillance networks. There are many origins to the theory of domination. The earliest ideas of dominating sets date back to the game of chess which has its origins in India. This area of graph theory is rich in history, full of interesting results and a host of unanswered research problems. There are more than a hundred models of dominating and related types of sets in graphs. Each type of domination sprouted, flowered and new results came into fruition resulting in many application in various fields. The different models of domination can be categorized based upon the type of domination and the nature of the sets of domination. The main aim of this book is to study (k,r) domination, (k,r) point domination and weak (k,r) point domination in graphs.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 60 pp. Englisch.…