Advanced Graph Theory / / by Santosh Kumar Yadav |
Autore | Yadav Santosh Kumar |
Edizione | [1st ed. 2023.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2023 |
Descrizione fisica | 1 online resource (294 pages) |
Disciplina |
574
511.5 |
Soggetto topico |
Graph theory
Discrete mathematics Graph Theory Applications of Discrete Mathematics Discrete Mathematics Teoria de grafs |
Soggetto genere / forma | Llibres electrònics |
ISBN | 3-031-22562-7 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Introduction -- Trees -- Planar Graphs -- Directed Graphs -- Matching and Covering -- Colouring of Graphs -- Enumeration and Pölya’s Theorem -- Spectral Properties of Graph -- Emerging Trends in Graph Theory. |
Record Nr. | UNINA-9910731471503321 |
Yadav Santosh Kumar
![]() |
||
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2023 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Algorithms and Discrete Applied Mathematics [[electronic resource] ] : 7th International Conference, CALDAM 2021, Rupnagar, India, February 11–13, 2021, Proceedings / / edited by Apurva Mudgal, C. R. Subramanian |
Edizione | [1st ed. 2021.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 |
Descrizione fisica | 1 online resource (519 pages) |
Disciplina | 004.0151 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer science—Mathematics
Algorithms Data structures (Computer science) Information theory Mathematics—Data processing Mathematics of Computing Design and Analysis of Algorithms Data Structures and Information Theory Computational Mathematics and Numerical Analysis Algorismes Geometria Teoria de grafs |
Soggetto genere / forma |
Congressos
Llibres electrònics |
ISBN | 3-030-67899-7 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Approximation Algorithms -- Online bin packing with overload cost -- Scheduling Trains with Small Stretch on a Unidirectional Line -- Algorithmic Aspects of Total Roman and Total Double Roman Domination in Graphs -- Approximation Algorithms for Orthogonal Line Centers -- Semitotal Domination on AT-free Graphs and Circle Graphs -- Burning Grids and Intervals -- Parameterized Algorithms -- On Parameterized Complexity of Liquid Democracy -- Acyclic coloring parameterized by directed clique-width. - On Structural Parameterizations of Load Coloring -- One-Sided Discrete Terrain Guarding and Chordal Graphs -- Parameterized Complexity of Locally Minimal Defensive Alliances -- Computational Geometry -- New variants of Perfect Non-crossing Matchings -- Cause I’m a Genial Imprecise Point: Outlier Detection for Uncertain Data -- A Worst-case Optimal Algorithm to Compute the Minkowski Sum of Convex Polytopes -- On the Intersections of Non-homotopic Loops -- Graph Theory -- On cd-coloring of trees and co-bipartite graphs -- Cut Vertex Transit Functions of Hypergraphs -- Lexicographic Product of Digraphs and Related Boundary-Type Sets -- The Connected Domination Number of Grids -- On degree sequences and eccentricities in pseudoline arrangement graphs. - Cops and Robber on Butterflies and Solid Grids -- b-Coloring of Some Powers of Hypercubes -- Chromatic Bounds for the Subclasses of $pK_2$ -Free Graphs -- Axiomatic characterization of the median function of a block graph -- On Coupon Coloring of Cartesian Product of Some Graphs -- On the Connectivity and the Diameter of Betweenness-Uniform Graphs. -Combinatorics and Algorithms -- On algorithms to find p-ordering -- Experimental Evaluation of a Local Search Approximation Algorithm for the Multiway Cut Problem -- Algorithmic analysis of priority-based bin packing -- Recursive methods for some problems in coding and random permutations -- Achieving positive rates with predetermined dictionaries -- Characterization of Dense Patterns Having Distinct Squares -- Graph Algorithms -- Failure and communication in a synchronized multi-drone system -- Memory Optimal Dispersion by Anonymous Mobile Robots -- Quantum and approximation algorithms for maximum witnesses of Boolean matrix products. -Template-driven Rainbow Coloring of Proper Interval Graphs -- Minimum Consistent Subset of Simple Graph Classes. - Computational Complexity -- Balanced Connected Graph Partition -- Hardness Results of Global Roman Domination in Graphs. . |
Record Nr. | UNISA-996464385203316 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Algorithms and Discrete Applied Mathematics : 7th International Conference, CALDAM 2021, Rupnagar, India, February 11–13, 2021, Proceedings / / edited by Apurva Mudgal, C. R. Subramanian |
Edizione | [1st ed. 2021.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 |
Descrizione fisica | 1 online resource (519 pages) |
Disciplina | 004.0151 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer science—Mathematics
Algorithms Data structures (Computer science) Information theory Mathematics—Data processing Mathematics of Computing Design and Analysis of Algorithms Data Structures and Information Theory Computational Mathematics and Numerical Analysis Algorismes Geometria Teoria de grafs |
Soggetto genere / forma |
Congressos
Llibres electrònics |
ISBN | 3-030-67899-7 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Approximation Algorithms -- Online bin packing with overload cost -- Scheduling Trains with Small Stretch on a Unidirectional Line -- Algorithmic Aspects of Total Roman and Total Double Roman Domination in Graphs -- Approximation Algorithms for Orthogonal Line Centers -- Semitotal Domination on AT-free Graphs and Circle Graphs -- Burning Grids and Intervals -- Parameterized Algorithms -- On Parameterized Complexity of Liquid Democracy -- Acyclic coloring parameterized by directed clique-width. - On Structural Parameterizations of Load Coloring -- One-Sided Discrete Terrain Guarding and Chordal Graphs -- Parameterized Complexity of Locally Minimal Defensive Alliances -- Computational Geometry -- New variants of Perfect Non-crossing Matchings -- Cause I’m a Genial Imprecise Point: Outlier Detection for Uncertain Data -- A Worst-case Optimal Algorithm to Compute the Minkowski Sum of Convex Polytopes -- On the Intersections of Non-homotopic Loops -- Graph Theory -- On cd-coloring of trees and co-bipartite graphs -- Cut Vertex Transit Functions of Hypergraphs -- Lexicographic Product of Digraphs and Related Boundary-Type Sets -- The Connected Domination Number of Grids -- On degree sequences and eccentricities in pseudoline arrangement graphs. - Cops and Robber on Butterflies and Solid Grids -- b-Coloring of Some Powers of Hypercubes -- Chromatic Bounds for the Subclasses of $pK_2$ -Free Graphs -- Axiomatic characterization of the median function of a block graph -- On Coupon Coloring of Cartesian Product of Some Graphs -- On the Connectivity and the Diameter of Betweenness-Uniform Graphs. -Combinatorics and Algorithms -- On algorithms to find p-ordering -- Experimental Evaluation of a Local Search Approximation Algorithm for the Multiway Cut Problem -- Algorithmic analysis of priority-based bin packing -- Recursive methods for some problems in coding and random permutations -- Achieving positive rates with predetermined dictionaries -- Characterization of Dense Patterns Having Distinct Squares -- Graph Algorithms -- Failure and communication in a synchronized multi-drone system -- Memory Optimal Dispersion by Anonymous Mobile Robots -- Quantum and approximation algorithms for maximum witnesses of Boolean matrix products. -Template-driven Rainbow Coloring of Proper Interval Graphs -- Minimum Consistent Subset of Simple Graph Classes. - Computational Complexity -- Balanced Connected Graph Partition -- Hardness Results of Global Roman Domination in Graphs. . |
Record Nr. | UNINA-9910483693803321 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Algorithms on Trees and Graphs : With Python Code / / by Gabriel Valiente |
Autore | Valiente Gabriel <1963-> |
Edizione | [2nd ed. 2021.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 |
Descrizione fisica | 1 online resource (392 pages) |
Disciplina | 511.5 |
Collana | Texts in Computer Science |
Soggetto topico |
Computer science - Mathematics
Discrete mathematics Algorithms Graph theory Python (Computer program language) C++ (Computer program language) Discrete Mathematics in Computer Science Graph Theory Python C++ Teoria de grafs |
Soggetto genere / forma | Llibres electrònics |
ISBN | 3-030-81885-3 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | 1. Introduction -- 2. Algorithmic Techniques -- 3. Tree Traversal -- 4. Tree Isomorphism -- 5. Graph Traversal -- 6. Clique, Independent Set, and Vertex Cover -- 7. Graph Isomorphism. |
Record Nr. | UNINA-9910502982803321 |
Valiente Gabriel <1963->
![]() |
||
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
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 |
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 | ||
|
Discrete Mathematics with Graph Theory / / by Santosh Kumar Yadav |
Autore | Yadav Santosh Kumar |
Edizione | [1st ed. 2023.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2023 |
Descrizione fisica | 1 online resource (XX, 648 p. 265 illus.) |
Disciplina | 511.1 |
Soggetto topico |
Discrete mathematics
Graph theory Discrete Mathematics Graph Theory Applications of Discrete Mathematics Matemàtica discreta Teoria de grafs |
Soggetto genere / forma | Llibres electrònics |
ISBN | 3-031-21321-1 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Preliminaries -- The languages of Sets -- Basic Combinatorics -- Mathematical Logic -- Relations -- Functions -- Lattice Theory -- Boolean Algebra and Applications -- Fuzzy Algebra -- Formal Languages and Automata Theory -- The Basics of Graph Theory -- Trees -- Planar Graphs -- Directed Graphs -- Matching and Covering -- Coloring of Graphs. . |
Record Nr. | UNINA-9910735090703321 |
Yadav Santosh Kumar
![]() |
||
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2023 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Domination games played on graphs / / Boéstjan Breésar [and three others] |
Autore | Breésar Boéstjan |
Pubbl/distr/stampa | Cham, Switzerland : , : Springer, , [2021] |
Descrizione fisica | 1 online resource (131 pages) |
Disciplina | 793.74 |
Collana | SpringerBriefs in Mathematics |
Soggetto topico |
Graph theory
Teoria de grafs Matemàtica recreativa |
Soggetto genere / forma | Llibres electrònics |
ISBN | 3-030-69087-3 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNISA-996466554103316 |
Breésar Boéstjan
![]() |
||
Cham, Switzerland : , : Springer, , [2021] | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Domination games played on graphs / / Boéstjan Breésar [and three others] |
Autore | Breésar Boéstjan |
Pubbl/distr/stampa | Cham, Switzerland : , : Springer, , [2021] |
Descrizione fisica | 1 online resource (131 pages) |
Disciplina | 793.74 |
Collana | SpringerBriefs in Mathematics |
Soggetto topico |
Graph theory
Teoria de grafs Matemàtica recreativa |
Soggetto genere / forma | Llibres electrònics |
ISBN | 3-030-69087-3 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNINA-9910484384703321 |
Breésar Boéstjan
![]() |
||
Cham, Switzerland : , : Springer, , [2021] | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Domination in Graphs : Core Concepts / / Teresa W. Haynes, Stephen T. Hedetniemi, and Michael A. Henning |
Autore | Haynes Teresa W. <1953-> |
Edizione | [First edition.] |
Pubbl/distr/stampa | Cham, Switzerland : , : Springer, , [2023] |
Descrizione fisica | 1 online resource (655 pages) |
Disciplina | 511.5 |
Collana | Springer Monographs in Mathematics Series |
Soggetto topico |
Domination (Graph theory)
Teoria de grafs |
Soggetto genere / forma | Llibres electrònics |
ISBN |
9783031094965
9783031094958 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | 1. Introduction -- 2. Historic background -- 3. Domination Fundamentals -- 4. Bounds in terms of order and size, and probability -- 5. Bounds in terms of degree -- 6. Bounds with girth and diameter conditions -- 7. Bounds in terms of forbidden subgraphs -- 8. Domination in graph families : Trees -- 9. Domination in graph families: Claw-free graphs -- 10. Domination in regular graphs including Cubic graphs -- 11. Domination in graph families: Planar graph -- 12. Domination in graph families: Chordal, bipartite, interval, etc -- 13. Domination in grid graphs and graph products -- 14. Progress on Vizing's Conjecture -- 15. Sums and Products (Nordhaus-Gaddum) -- 16. Domination Games -- 17. Criticality -- 18. Complexity and Algorithms -- 19. The Upper Domination Number -- 20. Domatic Numbers (for lower and upper gamma) and other dominating partitions, including the newly introduced Upper Domatic Number -- 21. Concluding Remarks, Conjectures, and Open Problems. |
Record Nr. | UNINA-9910720067503321 |
Haynes Teresa W. <1953->
![]() |
||
Cham, Switzerland : , : Springer, , [2023] | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|