Home > Mathematics and Science Textbooks > Mathematics > Combinatorics and graph theory > Threshold Graphs and Related Topics: Volume 56(Volume 56 Annals of Discrete Mathematics)
10%
Threshold Graphs and Related Topics: Volume 56(Volume 56 Annals of Discrete Mathematics)

Threshold Graphs and Related Topics: Volume 56(Volume 56 Annals of Discrete Mathematics)

          
5
4
3
2
1

International Edition


Premium quality
Premium quality
Bookswagon upholds the quality by delivering untarnished books. Quality, services and satisfaction are everything for us!
Easy Return
Easy return
Not satisfied with this product! Keep it in original condition and packaging to avail easy return policy.
Certified product
Certified product
First impression is the last impression! Address the book’s certification page, ISBN, publisher’s name, copyright page and print quality.
Secure Checkout
Secure checkout
Security at its finest! Login, browse, purchase and pay, every step is safe and secured.
Money back guarantee
Money-back guarantee:
It’s all about customers! For any kind of bad experience with the product, get your actual amount back after returning the product.
On time delivery
On-time delivery
At your doorstep on time! Get this book delivered without any delay.
Quantity:
Add to Wishlist

About the Book

Threshold graphs have a beautiful structure and possess many important mathematical properties. They have applications in many areas including computer science and psychology. Over the last 20 years the interest in threshold graphs has increased significantly, and the subject continues to attract much attention.The book contains many open problems and research ideas which will appeal to graduate students and researchers interested in graph theory. But above all Threshold Graphs and Related Topics provides a valuable source of information for all those working in this field.

Table of Contents:
Preface. Basic Terminology. Threshold Graphs. Motivation. Basic characterizations. Minimizing integral weights. Perfect graphs and algorithms. Threshold and split completions. Longest cycles and Hamiltonicity. Total coverings and total matchings. Ferrers Digraphs and Difference Graphs. Introduction. Ferrers digraphs, characterizations. The Ferrers dimension. Difference graphs. Degree Sequences. Graphical degree sequences. Threshold sequences. The polytope of degree sequences. Difference sequences. Applications.Introduction. Aggregation of inequalities. Synchronization. Cyclic scheduling. Guttman scales. Split Graphs. Introduction. Basic properties. Hamiltonian split graphs. The splittance of a graph. The Threshold Dimension. Introduction. Bounds for the threshold dimension. Dimensional properties. Operations preserving the threshold dimension. Restricted threshold dimension. NP-Completeness. Introduction. The partial order dimension. Related NP-complete problems. Other complexity results. The split dimension. Polar graphs. 2-Threshold Graphs. Introduction. Properties of 2-threshold graphs. Bithreshold graphs. Strict 2-threshold graphs. Recognizing threshold dimension 2. Recognizing difference dimension 2. Intersection threshold dimension 2. The Dilworth Number. Introduction. Graphs of Dilworth number 2. The Dilworth number and perfect graphs. Box-Threshold Graphs. Introduction. Elementary properties. A transportation model. Frames of BT graphs. Matroidal and Matrogenic Graphs. Introduction. Matroidal graphs. Matrogenic graphs. Matrogenic sequences. Domishold Graphs. Introduction. Notation and main results. Equidominating graphs. Pseudodomishold graphs. The Decomposition Method. Introduction. The canonical decomposition. Domishold graphs and decomposition. Box-threshold graphs and decomposition. Matroidal and matrogenic graphs and decomposition. Pseudothreshold and Equistable Graphs. Introduction. Pseudothreshold graphs. Equistable graphs. Threshold Weights and Measures.Introduction. Threshold weights. Threshold measures. Threshold and majorization gaps. Threshold Graphs and Order Relations. Introduction. Biorders. Bidimensions. Relations of bidimension 2. Multiple semiorders. Enumeration. Introduction. Enumeration of threshold graphs. Enumeration of difference graphs. Extremal Problems. Introduction. Large interval and threshold subgraphs of dense graphs. Maximizing the sum of squares of degrees. Other Extensions. Introduction. Geometric embeddings of graphs. Tolerance intersection graphs. Universal threshold graphs. Bibliography. List of Notations. Author Index. Index.


Best Sellers


Product Details
  • ISBN-13: 9780444892874
  • Publisher: Elsevier Science & Technology
  • Publisher Imprint: North-Holland
  • Height: 234 mm
  • No of Pages: 542
  • Series Title: Volume 56 Annals of Discrete Mathematics
  • Sub Title: Volume 56
  • Width: 156 mm
  • ISBN-10: 0444892877
  • Publisher Date: 13 Sep 1995
  • Binding: Hardback
  • Language: English
  • Returnable: N
  • Spine Width: 32 mm
  • Weight: 1015 gr


Similar Products

How would you rate your experience shopping for books on Bookswagon?

Add Photo
Add Photo

Customer Reviews

REVIEWS           
Click Here To Be The First to Review this Product
Threshold Graphs and Related Topics: Volume 56(Volume 56 Annals of Discrete Mathematics)
Elsevier Science & Technology -
Threshold Graphs and Related Topics: Volume 56(Volume 56 Annals of Discrete Mathematics)
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.

Threshold Graphs and Related Topics: Volume 56(Volume 56 Annals of Discrete Mathematics)

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!
    ASK VIDYA