Graphs, Combinatorics, Algorithms and Applications

by S. Balachandra Rao, S. Arumugam

Graphs, Combinatorics, Algorithms and Applications discusses current areas of research in graph theory such

• Graphoidal covers.
• Hyper graphs.
• Domination in graphs.
• Signed graphs.
• Graph labelings.
• Theoretical computer science.

This volume will serve as an excellent reference for experts and research scholars working in Graph Theory and related topics.

Table of Contents

• 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

Hardcover

Published January 30, 2005

About the author

Balachandra Rao was an Indian mathematician at National Institute of Advanced Studies in Bangalore. He authored several books in the field of science, astronomy, mathematics. He was also trained in Sanskrit literature. He dedicated his life towards decoding the rich intellectual heritage of the ancient India. He was also called S Balachandra Rao.