Artículos relacionados a Super Edge-Magic Sequences of Graphs and Applications:...

Super Edge-Magic Sequences of Graphs and Applications: Characteristics of SEMS and Chemical Applications - Tapa blanda

Vijayabarathi, A; Anjaneyulu, GSGN

 
9786202306188: Super Edge-Magic Sequences of Graphs and Applications: Characteristics of SEMS and Chemical Applications
Tapa blanda
ISBN 10: 6202306181 ISBN 13: 9786202306188
Editorial: Scholars' Press, 2018

Sinopsis

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.

"Sinopsis" puede pertenecer a otra edición de este libro.

Reseña del editor

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.

Biografía del autor

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.

"Sobre este título" puede pertenecer a otra edición de este libro.

Editorial
Scholars' Press
Año de publicación
2018
Idioma
Inglés
ISBN 10 
6202306181
ISBN 13 
9786202306188
Encuadernación
Tapa blanda
Número de páginas
144
Contacto del fabricante
no disponible
Persona responsable
no disponible