Graphs, Combinatorics, Algorithms and Applications
Home > Mathematics and Science Textbooks > Mathematics > Combinatorics and graph theory > Graphs, Combinatorics, Algorithms and Applications
Graphs, Combinatorics, Algorithms and Applications

Graphs, Combinatorics, Algorithms and Applications

|
     0     
5
4
3
2
1




Out of Stock


Notify me when this book is in stock
About the Book

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


Best Sellers


Product Details
  • ISBN-13: 9788173196126
  • Publisher: Narosa Publishing House
  • Publisher Imprint: Narosa Publishing House
  • Height: 280 mm
  • No of Pages: 198
  • Weight: 900 gr
  • ISBN-10: 8173196125
  • Publisher Date: 30 Jan 2005
  • Binding: Hardback
  • Language: English
  • Returnable: N
  • Width: 210 mm


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Graphs, Combinatorics, Algorithms and Applications
Narosa Publishing House -
Graphs, Combinatorics, Algorithms and Applications
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Graphs, Combinatorics, Algorithms and Applications

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals

    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!