9786202306188 - Super Edge-Magic Sequences of Graphs and Applications: Characteristics of SEMS and Chemical Applications de Vijayabarathi, A; Anjaneyulu, GSGN (9 resultados)

Condición: New. pp. 144.

Taschenbuch. Condición: Neu. Super Edge-Magic Sequences of Graphs and Applications | Characteristics of SEMS and Chemical Applications | A. Vijayabarathi (u. a.) | Taschenbuch | 144 S. | Englisch | 2018 | Scholars' Press | EAN 9786202306188 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu.

Paperback. Condición: Brand New. 144 pages. 8.66x5.91x0.33 inches. In Stock.

Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -In this book, we introduce a new concept of Super Edge-Magic Sequence (SEMS) of a Super Edge-Magic Graph (SEMG) with p vertices and q edges and its properties . We generate the special super edge-magic sequences on (q+1, q) and (q, q) graphs, which are unicyclic graphs and trees. We project above SEMS in a significant direction, which can give scope to frame applications of engineering like in Computer Science and in Chemistry. We design a method to calculate Wiener Index of Graph (molecular graph) and also through this sequence, we compute their intrinsic properties (like number of Atoms, bonds, cyclomatic number, chemical formula and nature of the compound is either chain or cycle) of some family of chemical compounds. We establish the concepts especially towards striped Maximal Outer Planar (MOP) graph .According to this we first frame one algorithm for striped MOP.Then we derive a theorem that yields formula for total number of super edge-magic graphs. Finally we analyze graphical properties like Independence Number, Chromatic Number, Dominance Number and Matching Number which are useful for Computer Science Applications.We calculate all the above by the concept of bond matrix. 144 pp. Englisch.

Condición: New. Print on Demand pp. 144.

Condición: New. PRINT ON DEMAND pp. 144.

Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Vijayabarathi ADr.A.Vijayabarathi is currently working as an Assistant Professor in Thiruvalluvar University Constituent College at Tittagudi, Tamilnadu,India and her area of Specialization is Graph Theory. Dr.G.S.G.N.Anjaneyulu is .

Taschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -In this book, we introduce a new concept of Super Edge-Magic Sequence (SEMS) of a Super Edge-Magic Graph (SEMG) with p vertices and q edges and its properties . We generate the special super edge-magic sequences on (q+1, q) and (q, q) graphs, which are unicyclic graphs and trees. We project above SEMS in a significant direction, which can give scope to frame applications of engineering like in Computer Science and in Chemistry. We design a method to calculate Wiener Index of Graph (molecular graph) and also through this sequence, we compute their intrinsic properties (like number of Atoms, bonds, cyclomatic number, chemical formula and nature of the compound is either chain or cycle) of some family of chemical compounds. We establish the concepts especially towards striped Maximal Outer Planar (MOP) graph .According to this we first frame one algorithm for striped MOP.Then we derive a theorem that yields formula for total number of super edge-magic graphs. Finally we analyze graphical properties like Independence Number, Chromatic Number, Dominance Number and Matching Number which are useful for Computer Science Applications.We calculate all the above by the concept of bond matrix.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 144 pp. Englisch.

Taschenbuch. Condición: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - In this book, we introduce a new concept of Super Edge-Magic Sequence (SEMS) of a Super Edge-Magic Graph (SEMG) with p vertices and q edges and its properties . We generate the special super edge-magic sequences on (q+1, q) and (q, q) graphs, which are unicyclic graphs and trees. We project above SEMS in a significant direction, which can give scope to frame applications of engineering like in Computer Science and in Chemistry. We design a method to calculate Wiener Index of Graph (molecular graph) and also through this sequence, we compute their intrinsic properties (like number of Atoms, bonds, cyclomatic number, chemical formula and nature of the compound is either chain or cycle) of some family of chemical compounds. We establish the concepts especially towards striped Maximal Outer Planar (MOP) graph .According to this we first frame one algorithm for striped MOP.Then we derive a theorem that yields formula for total number of super edge-magic graphs. Finally we analyze graphical properties like Independence Number, Chromatic Number, Dominance Number and Matching Number which are useful for Computer Science Applications.We calculate all the above by the concept of bond matrix.