Computing Chromatic Polynomials for Special Families of Graphs

Lingua: inglese

Editore: Forgotten Books, 2018

1333607121 / 9781333607128

Da: Forgotten Books, London, Regno UnitoForgotten Books

Venditore con 5 stelle

Venditore AbeBooks dal 2 giugno 2021

Visualizza gli articoli di questo venditore
Brossura

Condizione: Nuovo

EUR 16,59

 Spedizione gratuita 
Spedito da Regno Unito a U.S.A.

Quantità: Più di 20 disponibili

Aggiungi al carrello
Resi gratuiti per 30 giorni

Descrizione dell’articolo da parte del venditore

Print on Demand. This book delves into chromatic polynomials - a fascinating mathematical tool used to count the number of ways to color graphs without violating certain rules. The author introduces the concept of graph coloring and its history, providing a solid foundation for understanding chromatic polynomials. The book explores their applications in graph theory, particularly in determining the uniqueness of graphs based on their chromatic polynomials. The author masterfully presents various methods for computing chromatic polynomials, comparing their computational efficiency. They also investigate the chromatic properties of specific graph families, such as 8-graphs and their complements, uncovering interesting patterns and chromatic equivalence relationships. Additionally, the book examines the chromatic polynomials of tree complements, offering closed formulas for several families of tree graphs. It culminates in a surprising discovery that contradicts a previously held conjecture, highlighting the depth and complexity of chromatic polynomial theory. Through rigorous analysis and insightful observations, this book not only expands our understanding of chromatic polynomials but also provides valuable tools for further research in graph theory. It is a must-read for mathematicians, computer scientists, and anyone interested in the intriguing world of graph coloring. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book.

Codice articolo 9781333607128_0

Titolo
Computing Chromatic Polynomials for Special Families of Graphs
Autore
Beatrice M. Loerinc
Editore
Forgotten Books
Anno di pubblicazione
2018
Condizione
New
Tipo di libro
print-on-demand item
Rilegatura
Paperback
Lingua
inglese
ISBN 10
1333607121
ISBN 13
9781333607128
Cataloghi dei venditori
Algebra

Forgotten Books

London, Regno Unito

Venditore con 5 stelle

Venditore AbeBooks dal 2 giugno 2021

Tariffe di spedizione da Regno Unito a U.S.A.

ArticoloDa 5 a 10 giorni lavorativiDa 5 a 10 giorni lavorativi
Primo articoloEUR 0,00EUR 0,00
I tempi di consegna sono stabiliti dai venditori e variano in base al corriere e al paese. Gli ordini che devono attraversare una dogana possono subire ritardi e spetta agli acquirenti pagare eventuali tariffe o dazi associati. I venditori possono contattarti in merito ad addebiti aggiuntivi dovuti a eventuali maggiorazioni dei costi di spedizione dei tuoi articoli.

Metodi di pagamento

  • Visa
  • Mastercard
  • American Express
  • Carte Bleue
  • Apple Pay
  • Google Pay

Descrizione dello Store

Forgotten Books’ Classic Reprint Series utilizes the latest technology to regenerate facsimiles of historically important writings. Careful attention has been made to accurately preserve the original format of each page whilst digitally enhancing the quality of the aged text.

Specializzazione

Trade

Informazioni sull’azienda del venditore

FB &c Ltd

Dalton House, 60 Windsor Avenue
London, Regno Unito SW19 2RR