Home > Mathematics and Science Textbooks > Mathematics > Discrete mathematics > Combinatorics, Graph Theory and Computing: SEICCGTC 2021, Boca Raton, USA, March 8–12(448 Springer Proceedings in Mathematics & Statistics)
37%
Combinatorics, Graph Theory and Computing: SEICCGTC 2021, Boca Raton, USA, March 8–12(448 Springer Proceedings in Mathematics & Statistics)

Combinatorics, Graph Theory and Computing: SEICCGTC 2021, Boca Raton, USA, March 8–12(448 Springer Proceedings in Mathematics & Statistics)

          
5
4
3
2
1

Available


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

 This proceedings volume convenes selected, revised papers presented at the 52nd Southeastern International Conference on Combinatorics, Graph Theory and Computing (SEICCGTC 2021), virtually held at Florida Atlantic University in Boca Raton, USA, on March 8-12, 2021. As has been a tradition since its inception in 1970, this edition once more brought together mathematicians, practitioners, and scientists around novel findings in combinatorics, graph theory and computing, and their interactions. The lectures and works presented at the Conference have proven to be of great interest to other scientists and analysts employing these mathematical sciences in their professional activities in business, industry, and government. Such an environment promotes a better understanding of the roles of modern applied mathematics, combinatorics, and computer science. Many works have demonstrated that disciplines have increasingly contributed to each other. With this series of Conferences, the gaps between the fields tend to decrease even further. This volume is of particular interest for the community of pure and applied mathematicians in academia, industry, and government, working in combinatorics and graph theory, as well as related areas of computer science and the interactions among these fields. Its findings can also benefit a general audience of practitioners and students from related fields.

Table of Contents:
1.The es-Splitting Operation for Matroids  Representable over Prime Felds GF(p) (P. Malavadkar, S. Gunjal, U. Jagadale, M.M. Shikare, and B.N. Waphare).- 2.The Existence Problem for Strong Complete Mappings of Finite Groups(A.B. Evans).- 3.Differences of Functions with the Same Value Multiset(D. Cruz, A. Ramos, and I. Rubio).- 4.Mixed-Level Covering, Locating, and Detecting Arrays via Cyclotomy(Y. Akhtar, C.J. Colbourrn, and V.R. Syrotiuk).- 5.Resolutions for an Infinite Family of Bose Triple Systems(D. Lusi and C.J. Colbourn).- 6.Decomposition of the Johnson Graphs into Graph-Pairs of Order 4(A. Abueida and M. Daven).- 7.Some New Strongly Regular Graphs from Quadrics(L. Lane-Harvard and T. Panttila).- 8.Nonexistence of a Subfamily of a Family of Edge-Regular Graphs(R. McNeilis, T. Parker, and K. Roblee).- 9.On a Convex Geometric Connection to Threshold Logic(M.R. Emamy-K, G.A.M. Rios).- 10.Multicore Graphs: Characterization and Properties (L. Markenzon and N. Paciornik).- 11.Cospanning Characterizations of Violator and Co-Violator Spaces(Y. Kempner and V.E. Levit).- 12.(2, 3)-Cordial Trees and Paths(M. Santana, J. Mousley, D. Brown, and L.B. Beasley).- 13.(2, 3)-Cordial Oriented Hypercubes(J. Mousley, L.B. Beasley, M. Santana, and D. Brown).- 14.Structural Properties of m-ary n-dimensional Hypercubes(S. Anantapantula, E. Cheng, and L. Liptak).- 15.Graph Constructions Derived from Interconnection Networks(R. Draper).- 16.On the Target Pebbling Conjecture(G. Hurlbert and E. Seddiq).- 17.C_4-Face-Magic Labelings on Even Order Projective Grid Graphs(S.J. Curran and S.C. Locke).- 18.On the Locating Rainbow Connection Number of the Comb Product with complete Graphs or Trees(M.Imrona, A.N.M. Salmar, S. Uttunggadewa, and P.E. Patry).- 19.Cycle-Compelling Colorings of Graphs(A. Bachstein, W. Goddard, and J. Xue).- 20.Harmonious Colorings of Graphs(A. Byers, A.Adams, E.B. Calderon, O.Bindas, M. Cope, A. Summers, and R. Thapa).- 21. A Note on the Immersion Number of Generalized Mycielski Graphs(K.L. Collins, M.E. Heenehan, and J. McDonald).- 22. Recent Developments of Star-Critical Ramsey Numbers(J. Hook).- 23. The Zero Forcing Span of a Graph(B. Jacob).- 24. DNA Self-Assembly: Complete Tripartite Graphs and Cocktail Party Graphs(L. Almodovar, J.H. Lee, M. Neal, H. Todt, and J. Williams).- 25. Inverse of Hermitian Adjacency Matrix of Mixed Bipartite Graphs(O. Alomari and M. Abudayeh).- 26. Properties of Sierpinski Triangle Graphs(A. Bickle).- 27. Counting Vertices in Iterated Line Graphs(Z. King, L. Lane-Harvard, and T. Milligan).- 28. On 2-Factorizations of the Complete 3-Uniform Hypergraph of Order 12 Minus a 1-Factor(P. Adams, S.I. El-Zanati, P. Florido, and W. Turner).- 29. On Decompositions of Complete 3-Uniform Hypergraphs into a Linear Forest with 4 Edges(R.C. Bunge, E. Dawson, and M. Donovan).- 30. Exterior Corners on Bargraphs of Motzkin Words(T. Mansour and J.L. Ramirez).- 31. Some Connections between Restricted Dyck Paths, Polyominoes, and Non-Crossing Partitions(R. Florez, J.L. Ramirez, F.A. Velandia, and D. Vilamizar).- 32. Powers of Two as Sums of Two Balancing Numbers(J. Bartz, B. Dearden, J. Iiams, and J. Peterson).- 33. Sprague-Grundy Functions for Certain Infinite Acyclic Graphs(A. Meyerowitz).- 34. New Absolute Irreducibility Testing Criteria and Factorization of Multivariate Polynomials(C. Agrinsoni, H. Janwa, and M. Delgado).- 35. Resolution of a Conjecture on the Covering Radius of Linear Codes(J.C. Orosco and H. Janwa).- 36. Quantum Error-Correcting Codes over Small Fields from AG Codes(H. Janwa and F.L. Pinero-Gonzalez).- 37. A Go-Up Code Construction from Linear Codes Yielding Additive Codes from Quantum Stabilizer Codes(E.A. Arrieta and H. Janwa).- 38. Bent and Near-Bent Function Construction and 2-Error-Correcting Codes(J.W. Velazquez and H. Janwa).  


Best Sellers


Product Details
  • ISBN-13: 9783031529719
  • Publisher: Springer International Publishing AG
  • Publisher Imprint: Springer International Publishing AG
  • Height: 235 mm
  • No of Pages: 492
  • Series Title: 448 Springer Proceedings in Mathematics & Statistics
  • Width: 155 mm
  • ISBN-10: 3031529715
  • Publisher Date: 17 Jun 2025
  • Binding: Paperback
  • Language: English
  • Returnable: N
  • Sub Title: SEICCGTC 2021, Boca Raton, USA, March 8–12


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
Combinatorics, Graph Theory and Computing: SEICCGTC 2021, Boca Raton, USA, March 8–12(448 Springer Proceedings in Mathematics & Statistics)
Springer International Publishing AG -
Combinatorics, Graph Theory and Computing: SEICCGTC 2021, Boca Raton, USA, March 8–12(448 Springer Proceedings in Mathematics & Statistics)
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.

Combinatorics, Graph Theory and Computing: SEICCGTC 2021, Boca Raton, USA, March 8–12(448 Springer Proceedings in Mathematics & Statistics)

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