Combinatorics, Graph Theory and Computing [[electronic resource] ] : SEICCGTC 2020, Boca Raton, USA, March 9–13 / / edited by Frederick Hoffman
| Combinatorics, Graph Theory and Computing [[electronic resource] ] : SEICCGTC 2020, Boca Raton, USA, March 9–13 / / edited by Frederick Hoffman |
| Edizione | [1st ed. 2022.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2022 |
| Descrizione fisica | 1 online resource (327 pages) |
| Disciplina | 511.6 |
| Collana | Springer Proceedings in Mathematics & Statistics |
| Soggetto topico |
Discrete mathematics
Graph theory Algebraic fields Polynomials Computer science - Mathematics Convex geometry Discrete geometry Discrete Mathematics Graph Theory Field Theory and Polynomials Discrete Mathematics in Computer Science Convex and Discrete Geometry Anàlisi combinatòria Teoria de grafs |
| Soggetto genere / forma |
Congressos
Llibres electrònics |
| ISBN |
9783031053757
9783031053740 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Ratio Balancing Numbers(Bartz et al) -- An Unexpected Digit Permutation from Multiplying in any Number Base(Qu et al) -- A & Z Sequences for Double Riordan Arrays (Branch et al) -- Constructing Clifford Algebras for Windmill and Dutch Windmill Graphs; A New Proof of The Friendship Theorem(Myers) -- Finding Exact Values of a Character Sum (Peart et al) -- On Minimum Index Stanton 4-cycle Designs (Bunge et al) -- k-Plane Matroids and Whiteley’s Flattening Conjectures (Servatius et al) -- Bounding the edge cover of a hypergraph (Shahrokhi) -- A Generalization on Neighborhood Representatives (Holliday) -- Harmonious Labelings of Disconnected Graphs involving Cycles and Multiple Components Consisting of Starlike Trees(Abueida et al) -- On Rainbow Mean Colorings of Trees (Hallas et al) -- Examples of Edge Critical Graphs in Peg Solitaire (Beeler et al) -- Regular Tournaments with Minimum Split Domination Number and Cycle Extendability (Factor et al) -- Independence and Domination of Chess Pieces on Triangular Boards and on the Surface of a Tetrahedron(Munger et al) -- Efficient and Non-efficient Domination of Z-stacked Archimedean Lattices (Paskowitz et al) -- On subdivision graphs which are 2-steps Hamiltonian graphs and hereditary non 2-steps Hamiltonian graphs (Lee et al) -- On the Erd}os-S_os Conjecture for graphs with circumference at most k + 1 (Heissan et al) -- Regular graph and some vertex-deleted subgraph (Egawa et al) -- Connectivity and Extendability in Digraphs (Beasle) -- On the extraconnectivity of arrangement graphs (Cheng et al) -- k-Paths of k-Trees(Bickle) -- Rearrangement of the Simple Random Walk(Skyers et al) -- On the Energy of Transposition Graphs(DeDeo) -- A Smaller Upper Bound for the (4; 82) Lattice Site Percolation Threshold(Wierman). |
| Record Nr. | UNISA-996490346803316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2022 | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Combinatorics, Graph Theory and Computing : SEICCGTC 2020, Boca Raton, USA, March 9–13 / / edited by Frederick Hoffman
| Combinatorics, Graph Theory and Computing : SEICCGTC 2020, Boca Raton, USA, March 9–13 / / edited by Frederick Hoffman |
| Edizione | [1st ed. 2022.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2022 |
| Descrizione fisica | 1 online resource (327 pages) |
| Disciplina | 511.6 |
| Collana | Springer Proceedings in Mathematics & Statistics |
| Soggetto topico |
Discrete mathematics
Graph theory Algebraic fields Polynomials Computer science - Mathematics Convex geometry Discrete geometry Discrete Mathematics Graph Theory Field Theory and Polynomials Discrete Mathematics in Computer Science Convex and Discrete Geometry Anàlisi combinatòria Teoria de grafs |
| Soggetto genere / forma |
Congressos
Llibres electrònics |
| ISBN |
9783031053757
9783031053740 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Ratio Balancing Numbers(Bartz et al) -- An Unexpected Digit Permutation from Multiplying in any Number Base(Qu et al) -- A & Z Sequences for Double Riordan Arrays (Branch et al) -- Constructing Clifford Algebras for Windmill and Dutch Windmill Graphs; A New Proof of The Friendship Theorem(Myers) -- Finding Exact Values of a Character Sum (Peart et al) -- On Minimum Index Stanton 4-cycle Designs (Bunge et al) -- k-Plane Matroids and Whiteley’s Flattening Conjectures (Servatius et al) -- Bounding the edge cover of a hypergraph (Shahrokhi) -- A Generalization on Neighborhood Representatives (Holliday) -- Harmonious Labelings of Disconnected Graphs involving Cycles and Multiple Components Consisting of Starlike Trees(Abueida et al) -- On Rainbow Mean Colorings of Trees (Hallas et al) -- Examples of Edge Critical Graphs in Peg Solitaire (Beeler et al) -- Regular Tournaments with Minimum Split Domination Number and Cycle Extendability (Factor et al) -- Independence and Domination of Chess Pieces on Triangular Boards and on the Surface of a Tetrahedron(Munger et al) -- Efficient and Non-efficient Domination of Z-stacked Archimedean Lattices (Paskowitz et al) -- On subdivision graphs which are 2-steps Hamiltonian graphs and hereditary non 2-steps Hamiltonian graphs (Lee et al) -- On the Erd}os-S_os Conjecture for graphs with circumference at most k + 1 (Heissan et al) -- Regular graph and some vertex-deleted subgraph (Egawa et al) -- Connectivity and Extendability in Digraphs (Beasle) -- On the extraconnectivity of arrangement graphs (Cheng et al) -- k-Paths of k-Trees(Bickle) -- Rearrangement of the Simple Random Walk(Skyers et al) -- On the Energy of Transposition Graphs(DeDeo) -- A Smaller Upper Bound for the (4; 82) Lattice Site Percolation Threshold(Wierman). |
| Record Nr. | UNINA-9910595024203321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2022 | ||
| Lo trovi qui: Univ. Federico II | ||
| ||