| Graphs, Combinatorics, Algorithms and Applications | |
| Authors: S. Arumugam, B. D. Acharya, S. B. Rao | ISBN:
978-81-7319-612-6 |
About the book Graphs, Combinatorics, Algorithms and Applications: The research papers contributed by leading experts in their respective field discusses current areas of research in graph theory such as: · Graphoidal covers · Hyper graphs · Domination in graph · Signed graphs · Graph labelings and · Theoretical computer science This volume will serve as an excellent reference for experts and research scholars working in Graph Theory and related topics. | |
Key Features |
|
Table of content Preface / List of Participants / Graphs with size equal to order plus graphoidal covering number / A study of regular picture languages using petri nets and graph grammars / On endomorphisms of finite abelian groups with an application / Existence of Hamilton cycles in prisms over graphs / Some families of E3-cordial graphs / Graph equations for line graphs, qlick graphs and plick graphs / Miscellaneous properties of line splitting graphs / Recognizable picture languages / Hamiltonian chains in hypergraphs - A survey / Construction of some new finite graphs using group representations / Subarray complexity of finite arrays / Super edge-magic strength of some new classes of graphs-II / Some new classes of super magic graphs / Trees with large total domination number / Construction of super edge magic graphs / On Cubic Graphs with equal domination number and chromatic number / Degree sequence from elementary contractions / Bounds for the eigenvalues of a graph / Graceful complete signed graphs / Some sigma labeled graphs : I / Special factors of partial words and trapezoidal partial words / Some results on complementary perfect domination number of a graph / Some improved lower bounds for the edge achromatic number of a complete graph / Characterizations of trees with respect to some domination related properties / Imbedding in a graph in which all maximal cliques are of the same size / Lindenmayer systems and Watson-Crick complementarity / Paley type graphs / Efficient dominating sets in cayley graphs / Embedding index of nonindominable Graphs / Wiener number of a maximal outer planar graph Audience Students and Researchers | |
 | |