Super Edge-Magic Sequences of Graphs and Applications: Characteristics of SEMS and Chemical Applications - Couverture souple

Vijayabarathi, A; Anjaneyulu, GSGN

 
9786202306188: Super Edge-Magic Sequences of Graphs and Applications: Characteristics of SEMS and Chemical Applications
Couverture souple
ISBN 10 : 6202306181 ISBN 13 : 9786202306188
Editeur : Scholars' Press, 2018

Synopsis

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.

Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.

Présentation de l'éditeur

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.

Biographie de l'auteur

Dr.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 currently working as a Professor,VIT, Vellore, India. His research interest includes Cryptography, Algebra and Graph Theory.

Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.

Éditeur
Scholars' Press
Date d'édition
2018
Langue
anglais
ISBN 10 
6202306181
ISBN 13 
9786202306188
Reliure
Broché
Nombre de pages
144
Coordonnées du fabricant
non disponible
Personne responsable
non disponible