Combinatorics, Graph Theory and Computing
Springer International Publishing (Verlag)
978-3-031-62165-9 (ISBN)
- Noch nicht erschienen - erscheint am 02.01.2025
- Versandkostenfrei innerhalb Deutschlands
- Auch auf Rechnung
- Verfügbarkeit in der Filiale vor Ort prüfen
- Artikel merken
This proceedings volume compiles selected, revised papers presented at the 53rd SouthEastern International Conference on Combinatorics, Graph Theory, and Computing (SEICCGTC 2022), which took place at Florida Atlantic University in Boca Raton, USA, from March 7th to 11th, 2022.
The SEICCGTC is widely regarded as a trendsetter for other conferences worldwide. Many ideas and themes initially discussed here have subsequently been explored in other conferences and symposia.
Since 1970, the conference has been held annually in Baton Rouge, Louisiana, and Boca Raton, Florida. Over the years, it has grown to become the primary annual conference in its fields, playing a crucial role in disseminating results and fostering collaborative work.
This volume is tailored for the community of pure and applied mathematicians in academia, industry, and government, who work in combinatorics and graph theory, as well as related areas of computer science and the intersections among these fields.
- Agrinsoni C., Janwa H., Delgado M. A New Absolute Irreducibility Criterion for Multivariate Polynomials over Finite Fields.- Abueida A., Daven M. On Decompositions of the Johnson Graph.- Almodóvar L., Brady E., Fitzgerald M., Su H.-H., Todt H. DNA Self-Assembly: Friendship Graphs.- Bajnok B. Additive Combinatorics in Groups and Geometric Combinatorics on Spheres.- Bajnok B. A Walk Through Some Newer Parts of Additive Combinatorics.- Berry T., Schluchter S. Applications of Topological Graph Theory to 2-Manifold Learning.- Bickle A. Nordhaus-Gaddum Theorems for Multifactor Decompositions.- Boats J., Kikas L. The Pansophy of Semi Directed Graphs.- Bunge R.C., Dodson S.R., El-Zanati S.I., Franzmeier J., Horne D. Decomposing the -fold complete 3-uniform hypergraph into the lines of the Pasch configuration.- Bunge R.C., El-Zanati S.I., Kirkpatrick J.N., Sanderson S.M., Severino M.J., Turner W.F. The Spectrum Problem for the 4-Uniform 4-Colorable 3-Cycles with Maximum Degree 2.- Bass C., Butler S. Passing Drops and Descents.- Chand P., Ollis M.A. The Buratti-Horak-Rosa Conjecture Holds for Some Underlying Sets of Size Three.- Choi S.-Y., Guan P. On the Minimum Locating Number of Graphs with a Given Order.- Cloteaux B. Graphic Approximation of Integer Sequences.- Davenport D., Fall F., Francis J., Lee T. Production Varieties of Double Riordan Arrays.- Doucette A., Suffel C. j-Multiple, k-Component Order Neighbor Connectivity.- Hoffman F., Heuss S., Low R., Wierman J. The Volume Editors will be listed in the following order in the contract.- Khodkar A., Leach D. Signed Magic Arrays with Certain Property.- Linthacum N., Martin L., McKenzie T., Overbay S., Tan L.A. Mobius Book Embeddings.- Lu S., Yerger C. The Existence of a Knight's Tour on the Surface of Rectangular Boxes.- Meissner L.H., Saccoman J.T. Strongly Regular Multigraphs.- Meyerowitz A. Tiling with Three Element Sets.- McKee T.A. Characterizing s-Strongly Chordal Graphs using 2-Paths and k-Chords.- Melles C.G., Joyner D. A Matrix Criterion for Harmonic Morphisms of Graphs with Applications to Graph Products.- Olejniczak D., Vandell R. Changing the Uniform Spectrum by Deleting Edges.- Sarvate D.G., Woldenmariam D.M., Zhang L. Group Divisible Designs with Three Groups and Block Size 4.- Varghese S., Lakshmanan S.A., Arumugam S. Geodesic Leech Graphs.- Wang J., Fehribach J.D. Prime, Composite, and Fundamental Kirchhoff Graphs.- Wierman J.C., Oberly S.P. A New Upper Bound for the Site Percolation Threshold of the Square Lattice.- Zeleke M., Jani M. On Combinatorial Interpretations of some Elements of the Riordan Group.
Erscheint lt. Verlag | 2.1.2025 |
---|---|
Reihe/Serie | Springer Proceedings in Mathematics & Statistics |
Mitarbeit |
Chef-Herausgeber: Frederick Hoffman |
Zusatzinfo | XV, 427 p. 173 illus., 46 illus. in color. |
Verlagsort | Cham |
Sprache | englisch |
Maße | 155 x 235 mm |
Themenwelt | Informatik ► Theorie / Studium ► Algorithmen |
Mathematik / Informatik ► Mathematik ► Graphentheorie | |
Schlagworte | algorithms • combinatorics • Computer Science • computing • design theory • Enumeration • graph theory • Hypergraphs • polynomials • Proceedings • Riordan arrays • SEICCGTC |
ISBN-10 | 3-031-62165-4 / 3031621654 |
ISBN-13 | 978-3-031-62165-9 / 9783031621659 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
aus dem Bereich