Items related to Graphs, Combinatorics, Algorithms and Applications

Graphs, Combinatorics, Algorithms and Applications - Hardcover

 
9788173196126: Graphs, Combinatorics, Algorithms and Applications

Synopsis

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.

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

"synopsis" may belong to another edition of this title.

Buy Used

Condition: Very Good
View this item

US$ 4.00 shipping within U.S.A.

Destination, rates & speeds

Search results for Graphs, Combinatorics, Algorithms and Applications

Stock Image

Arumugam, S.
ISBN 10: 8173196125 ISBN 13: 9788173196126
Used Hardcover

Seller: Bookmonger.Ltd, HILLSIDE, NJ, U.S.A.

Seller rating 4 out of 5 stars 4-star rating, Learn more about seller ratings

Hardcover. Condition: Very Good. Seller Inventory # mon0000419666

Contact seller

Buy Used

US$ 80.77
Convert currency
Shipping: US$ 4.00
Within U.S.A.
Destination, rates & speeds

Quantity: 1 available

Add to basket