Graphs, Combinatorics, Algorithms and Applications - S. Arumugam, B.D. Acharya, S.B. Rao

Graphs, Combinatorics, Algorithms and Applications

Buch | Hardcover
198 Seiten
2005
Narosa Publishing House (Verlag)
978-81-7319-612-6 (ISBN)
68,55 inkl. MwSt
  • Titel ist leider vergriffen;
    keine Neuauflage
  • Artikel merken
Graphs, Combinatorics, Algorithms and Applications discusses current areas of research in graph theory such as:


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.

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

Erscheint lt. Verlag 10.2.2005
Verlagsort New Dehli
Sprache englisch
Maße 210 x 280 mm
Gewicht 900 g
Themenwelt Mathematik / Informatik Mathematik Graphentheorie
ISBN-10 81-7319-612-5 / 8173196125
ISBN-13 978-81-7319-612-6 / 9788173196126
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich
Numbers and Counting, Groups, Graphs, Orders and Lattices

von Volker Diekert; Manfred Kufleitner; Gerhard Rosenberger …

Buch | Softcover (2023)
De Gruyter (Verlag)
64,95