Magic Graphs [[electronic resource] /] / by Alison M. Marr, W.D. Wallis |
Autore | Marr Alison M |
Edizione | [2nd ed. 2013.] |
Pubbl/distr/stampa | New York, NY : , : Springer New York : , : Imprint : Birkhäuser, , 2013 |
Descrizione fisica | 1 online resource (198 p.) |
Disciplina | 511.5 |
Soggetto topico |
Combinatorics
Computer science—Mathematics Applied mathematics Engineering mathematics Discrete Mathematics in Computer Science Applications of Mathematics |
ISBN | 0-8176-8391-7 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Preface -- List of Figures -- Preliminaries -- Edge-Magic Total Labelings -- Vertex-Magic Total Labelings -- Totally Magic Labelings -- Magic Type Labeling of Digraphs -- Notes on the Research Problems -- References -- Bibliography -- Answers to Selected Exercises -- Index. |
Record Nr. | UNINA-9910437870703321 |
Marr Alison M | ||
New York, NY : , : Springer New York : , : Imprint : Birkhäuser, , 2013 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
The many facets of graph theory : proceedings of the conference held at Western Michigan University, Kalamazoo/MI., October 31-November 2, 1968 / / edited by G. Chartrand and S. F. Kapoor |
Edizione | [1st ed. 1969.] |
Pubbl/distr/stampa | Berlin ; ; Heidelberg ; ; New York : , : Springer-Verlag, , [1969] |
Descrizione fisica | 1 online resource (VIII, 292 p.) |
Disciplina | 511.5 |
Collana | Lecture notes in mathematics |
Soggetto topico | Graph theory |
ISBN | 3-540-36161-8 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Graphs and binary relations -- Graph theory and finite projective planes -- On Steinitz's theorem concerning convex 3-polytopes and on some properties of planar graphs -- Analogues of ramsey numbers -- A survey of packings and coverings of graphs -- Section graphs for finite permutation groups -- Nearly regular polyhedra with two exceptional faces -- Some applications of graph theory to number theory -- On the number of cycles in permutation graphs -- A note on a category of graphs -- Reconstructing graphs -- Incidence patterns of graphs and complexes -- A many-facetted problem of zarankiewicz -- Graph theory and lie algebra -- Matroids versus graphs -- On classes of graphs defined by special cutsets of lines -- Rank 3 graphs -- Variations on a theorem of Pósa -- Critically and minimally n-connected graphs -- On reconstruction of graphs -- The cohesive strength of graphs -- Hypo-properties in graphs -- An extension of graphs -- Hamiltonian circuits in graphs and digraphs -- On the density and chromatic numbers of graphs -- Methods for the enumeration of multigraphs -- Characterizations of 2-dimensional trees -- A combinatorial identity -- An application of graph theory to social psychology -- A topological influence: Homeomorphically irreducible graphs -- Graph theory and “Instant Insanity” -- Arc digraphs and traversability. |
Record Nr. | UNISA-996466643903316 |
Berlin ; ; Heidelberg ; ; New York : , : Springer-Verlag, , [1969] | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Map color theorem / Gerhard Ringel |
Autore | Ringel, Gerhard |
Pubbl/distr/stampa | Berlin : Springer-Verlag, 1974 |
Descrizione fisica | xii, 191p. ; 24 cm. |
Disciplina | 511.5 |
Collana | Grundlehren der mathematischen Wissenschaften = A series of comprehensive studies in mathematics, 0072-7830 ; 209 |
Soggetto topico |
Combinatorial analysis
Four color problem Graph theory Topology |
Classificazione | AMS 05C10 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNISALENTO-991001101209707536 |
Ringel, Gerhard | ||
Berlin : Springer-Verlag, 1974 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. del Salento | ||
|
Matching theory / L. Lovász, M. D. Plummer |
Autore | Lovasz, Laszlo |
Pubbl/distr/stampa | Amsterdam ; New York : North-Holland, 1986 |
Descrizione fisica | xxxiii, 544 p. ; 24 cm |
Disciplina | 511.5 |
Altri autori (Persone) | Plummer, M. D.author |
Collana |
Annals of discrete mathematics ; 29
North-Holland mathematics studies, 0304-0208 ; 21 |
Soggetto topico | Factorization |
ISBN | 0444879161 |
Classificazione | AMS 05C70 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNISALENTO-991001104189707536 |
Lovasz, Laszlo | ||
Amsterdam ; New York : North-Holland, 1986 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. del Salento | ||
|
Matching theory / byL. Lovasz and M.D. Plummer |
Pubbl/distr/stampa | Amsterdam : North-Holland, 1986 |
Descrizione fisica | XXXIII, 544 p. : ill. ; 23 cm |
Disciplina | 511.5 |
Collana |
Annals of discrete mathematics
North-Holland mathematics studies |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNISA-990000617940203316 |
Amsterdam : North-Holland, 1986 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Mathematical foundations and applications of graph entropy Edited by Matthias Dehmer [and four others] |
Pubbl/distr/stampa | Weinheim, [Germany] : , : Wiley-VCH Verlag GmbH & Co. KGaA, , 2016 |
Descrizione fisica | 1 online resource (299 p.) |
Disciplina | 511.5 |
Collana | Quantitative and Network Biology |
Soggetto topico | Graph theory - Data processing |
Soggetto genere / forma | Electronic books. |
ISBN |
3-527-69325-4
3-527-69322-X 3-527-69324-6 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto |
Cover; Title Page; Copyright; Contents; List of Contributors; Preface; Chapter 1 Entropy and Renormalization in Chaotic Visibility Graphs; 1.1 Mapping Time Series to Networks; 1.1.1 Natural and Horizontal Visibility Algorithms; 1.1.2 A Brief Overview of Some Initial Applications; 1.1.2.1 Seismicity; 1.1.2.2 Hurricanes; 1.1.2.3 Turbulence; 1.1.2.4 Financial Applications; 1.1.2.5 Physiology; 1.2 Visibility Graphs and Entropy; 1.2.1 Definitions of Entropy in Visibility Graphs; 1.2.2 Pesin Theorem in Visibility Graphs; 1.2.3 Graph Entropy Optimization and Critical Points
1.3 Renormalization Group Transformations of Horizontal Visibility Graphs1.3.1 Tangent Bifurcation; 1.3.2 Period-Doubling Accumulation Point; 1.3.3 Quasi-Periodicity; 1.3.4 Entropy Extrema and RG Transformation; 1.3.4.1 Intermittency; 1.3.4.2 Period Doubling; 1.3.4.3 Quasi-periodicity; 1.4 Summary; 1.5 Acknowledgments; References; Chapter 2 Generalized Entropies of Complex and Random Networks; 2.1 Introduction; 2.2 Generalized Entropies; 2.3 Entropy of Networks: Definition and Properties; 2.4 Application of Generalized Entropy for Network Analysis; 2.5 Open Networks; 2.6 Summary; References Chapter 3 Information Flow and Entropy Production on Bayesian Networks3.1 Introduction; 3.1.1 Background; 3.1.2 Basic Ideas of Information Thermodynamics; 3.1.3 Outline of this Chapter; 3.2 Brief Review of Information Contents; 3.2.1 Shannon Entropy; 3.2.2 Relative Entropy; 3.2.3 Mutual Information; 3.2.4 Transfer Entropy; 3.3 Stochastic Thermodynamics for Markovian Dynamics; 3.3.1 Setup; 3.3.2 Energetics; 3.3.3 Entropy Production and Fluctuation Theorem; 3.4 Bayesian Networks; 3.5 Information Thermodynamics on Bayesian Networks; 3.5.1 Setup; 3.5.2 Information Contents on Bayesian Networks 3.5.3 Entropy Production3.5.4 Generalized Second Law; 3.6 Examples; 3.6.1 Example 1: Markov Chain; 3.6.2 Example 2: Feedback Control with a Single Measurement; 3.6.3 Example 3: Repeated Feedback Control with Multiple Measurements; 3.6.4 Example 4: Markovian Information Exchanges; 3.6.5 Example 5: Complex Dynamics; 3.7 Summary and Prospects; References; Chapter 4 Entropy, Counting, and Fractional Chromatic Number; 4.1 Entropy of a Random Variable; 4.2 Relative Entropy and Mutual Information; 4.3 Entropy and Counting; 4.4 Graph Entropy; 4.5 Entropy of a Convex Corner; 4.6 Entropy of a Graph 4.7 Basic Properties of Graph Entropy4.8 Entropy of Some Special Graphs; 4.9 Graph Entropy and Fractional Chromatic Number; 4.10 Symmetric Graphs with respect to Graph Entropy; 4.11 Conclusion; Appendix 4.A; References; Chapter 5 Graph Entropy: Recent Results and Perspectives; 5.1 Introduction; 5.2 Inequalities and Extremal Properties on (Generalized) Graph Entropies; 5.2.1 Inequalities for Classical Graph Entropies and Parametric Measures; 5.2.2 Graph Entropy Inequalities with Information Functions fV, fP and fC; 5.2.3 Information Theoretic Measures of UHG Graphs 5.2.4 Bounds for the Entropies of Rooted Trees and Generalized Trees |
Record Nr. | UNINA-9910134854503321 |
Weinheim, [Germany] : , : Wiley-VCH Verlag GmbH & Co. KGaA, , 2016 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Mathematical foundations and applications of graph entropy Edited by Matthias Dehmer [and four others] |
Pubbl/distr/stampa | Weinheim, [Germany] : , : Wiley-VCH Verlag GmbH & Co. KGaA, , 2016 |
Descrizione fisica | 1 online resource (299 p.) |
Disciplina | 511.5 |
Collana | Quantitative and Network Biology |
Soggetto topico | Graph theory - Data processing |
ISBN |
3-527-69325-4
3-527-69322-X 3-527-69324-6 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto |
Cover; Title Page; Copyright; Contents; List of Contributors; Preface; Chapter 1 Entropy and Renormalization in Chaotic Visibility Graphs; 1.1 Mapping Time Series to Networks; 1.1.1 Natural and Horizontal Visibility Algorithms; 1.1.2 A Brief Overview of Some Initial Applications; 1.1.2.1 Seismicity; 1.1.2.2 Hurricanes; 1.1.2.3 Turbulence; 1.1.2.4 Financial Applications; 1.1.2.5 Physiology; 1.2 Visibility Graphs and Entropy; 1.2.1 Definitions of Entropy in Visibility Graphs; 1.2.2 Pesin Theorem in Visibility Graphs; 1.2.3 Graph Entropy Optimization and Critical Points
1.3 Renormalization Group Transformations of Horizontal Visibility Graphs1.3.1 Tangent Bifurcation; 1.3.2 Period-Doubling Accumulation Point; 1.3.3 Quasi-Periodicity; 1.3.4 Entropy Extrema and RG Transformation; 1.3.4.1 Intermittency; 1.3.4.2 Period Doubling; 1.3.4.3 Quasi-periodicity; 1.4 Summary; 1.5 Acknowledgments; References; Chapter 2 Generalized Entropies of Complex and Random Networks; 2.1 Introduction; 2.2 Generalized Entropies; 2.3 Entropy of Networks: Definition and Properties; 2.4 Application of Generalized Entropy for Network Analysis; 2.5 Open Networks; 2.6 Summary; References Chapter 3 Information Flow and Entropy Production on Bayesian Networks3.1 Introduction; 3.1.1 Background; 3.1.2 Basic Ideas of Information Thermodynamics; 3.1.3 Outline of this Chapter; 3.2 Brief Review of Information Contents; 3.2.1 Shannon Entropy; 3.2.2 Relative Entropy; 3.2.3 Mutual Information; 3.2.4 Transfer Entropy; 3.3 Stochastic Thermodynamics for Markovian Dynamics; 3.3.1 Setup; 3.3.2 Energetics; 3.3.3 Entropy Production and Fluctuation Theorem; 3.4 Bayesian Networks; 3.5 Information Thermodynamics on Bayesian Networks; 3.5.1 Setup; 3.5.2 Information Contents on Bayesian Networks 3.5.3 Entropy Production3.5.4 Generalized Second Law; 3.6 Examples; 3.6.1 Example 1: Markov Chain; 3.6.2 Example 2: Feedback Control with a Single Measurement; 3.6.3 Example 3: Repeated Feedback Control with Multiple Measurements; 3.6.4 Example 4: Markovian Information Exchanges; 3.6.5 Example 5: Complex Dynamics; 3.7 Summary and Prospects; References; Chapter 4 Entropy, Counting, and Fractional Chromatic Number; 4.1 Entropy of a Random Variable; 4.2 Relative Entropy and Mutual Information; 4.3 Entropy and Counting; 4.4 Graph Entropy; 4.5 Entropy of a Convex Corner; 4.6 Entropy of a Graph 4.7 Basic Properties of Graph Entropy4.8 Entropy of Some Special Graphs; 4.9 Graph Entropy and Fractional Chromatic Number; 4.10 Symmetric Graphs with respect to Graph Entropy; 4.11 Conclusion; Appendix 4.A; References; Chapter 5 Graph Entropy: Recent Results and Perspectives; 5.1 Introduction; 5.2 Inequalities and Extremal Properties on (Generalized) Graph Entropies; 5.2.1 Inequalities for Classical Graph Entropies and Parametric Measures; 5.2.2 Graph Entropy Inequalities with Information Functions fV, fP and fC; 5.2.3 Information Theoretic Measures of UHG Graphs 5.2.4 Bounds for the Entropies of Rooted Trees and Generalized Trees |
Record Nr. | UNINA-9910829886303321 |
Weinheim, [Germany] : , : Wiley-VCH Verlag GmbH & Co. KGaA, , 2016 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Mathematical foundations of complex networked information systems : Politecnico di Torino, Verrès, Italy 2009 / P. R. Kumar ... [et al.] ; Fabio Fagnani, Sophie M. Fosson, Chiara Ravazzi, editors |
Autore | CIME Summer School <2009 ; Verrès, Italy> |
Pubbl/distr/stampa | Cham [Switzerland] : Springer, c2015 |
Descrizione fisica | vii, 135 p. : ill. (some colors) ; 24 cm |
Disciplina | 511.5 |
Altri autori (Persone) |
Kumar, P. R.
Fagnani, Fabio Fosson, Sophie M. Ravazzi, Chiara |
Collana | Lecture notes in mathematics, 0075-8434 ; 2141 |
Soggetto topico |
Graph theory
Mathematical optimization |
ISBN | 9783319169668 |
Classificazione |
AMS 94-06
AMS 05-06 AMS 68-06 LC QA166 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNISALENTO-991003263239707536 |
CIME Summer School <2009 ; Verrès, Italy> | ||
Cham [Switzerland] : Springer, c2015 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. del Salento | ||
|
Mathematical foundations of complex networked information systems [e-book] : Politecnico di Torino, Verrès, Italy 2009 / P. R. Kumar ... [et al.] ; Fabio Fagnani, Sophie M. Fosson, Chiara Ravazzi, editors |
Autore | CIME Summer School <2009 ; Verrès, Italy> |
Pubbl/distr/stampa | Cham [Switzerland] : Springer, c2015 |
Descrizione fisica | 1 online resource (vii, 135 pages) |
Disciplina | 511.5 |
Altri autori (Persone) |
Kumar, P. R.
Fagnani, Fabio Fosson, Sophie M. Ravazzi, Chiara |
Collana | Lecture notes in mathematics, 1617-9692 ; 2141 |
Soggetto topico |
Graph theory
Mathematical optimization |
ISBN | 9783319169675 |
Classificazione |
AMS 94-06
AMS 05-06 AMS 68-06 LC QA166 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNISALENTO-991003265659707536 |
CIME Summer School <2009 ; Verrès, Italy> | ||
Cham [Switzerland] : Springer, c2015 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. del Salento | ||
|
Mathematical Foundations of Complex Networked Information Systems [[electronic resource] ] : Politecnico di Torino, Verrès, Italy 2009 / / by P.R. Kumar, Martin J. Wainwright, Riccardo Zecchina ; edited by Fabio Fagnani, Sophie M. Fosson, Chiara Ravazzi |
Autore | Kumar P.R |
Edizione | [1st ed. 2015.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 |
Descrizione fisica | 1 online resource (VII, 135 p. 34 illus., 24 illus. in color.) |
Disciplina | 511.5 |
Collana | C.I.M.E. Foundation Subseries |
Soggetto topico |
System theory
Graph theory Mathematical physics Physics Complex Systems Graph Theory Mathematical Applications in the Physical Sciences Applications of Graph Theory and Complex Networks |
ISBN | 3-319-16967-X |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto |
Intro -- Preface -- Contents -- Some Introductory Notes on Random Graphs -- 1 Introduction -- 2 Generalities on Graphs -- 2.1 Basic Definitions and Notation -- 2.2 Large Scale Networks -- 3 Erdős-Rényi Model -- 3.1 Connectivity and Giant Component -- 3.2 Branching Processes -- 3.3 Behavior at the Giant Component Threshold -- 4 Configuration Model -- 4.1 Connectivity and Giant Component -- 5 Random Geometric Graph -- 5.1 Connectivity -- 5.2 Giant Component -- References -- Statistical Physics and Network Optimization Problems -- 1 Statistical Physics and Optimization -- 2 Elements of Statistical Physics -- 3 Statistical Physics Approach to Percolation in Random Graphs -- 3.1 The Potts Model Representation -- 3.1.1 Symmetric Saddle-Point -- 3.1.2 Symmetry Broken Saddle-Point -- 4 Statistical Physics Methods for More Complex Problems -- 5 Bethe Approximation and Message Passing Algorithms -- 5.1 Belief Propagation -- 5.1.1 Marginals -- 5.1.2 Free Energy -- 5.1.3 Graphs with Loops -- 5.2 The β→∞ Limit: Minsum Algorithm -- 5.3 Finding a Solution: Decimation and Reinforcement Algorithms -- 5.3.1 Decimation -- 5.3.2 Reinforcement -- 5.4 Replica Symmetry Breaking and Higher Levels of BP -- References -- Graphical Models and Message-Passing Algorithms: Some Introductory Lectures -- 1 Introduction -- 2 Probability Distributions and Graphical Structure -- 2.1 Directed Graphical Models -- 2.1.1 Conditional Independence Properties for Directed Graphs -- 2.1.2 Equivalence of Representations -- 2.2 Undirected Graphical Models -- 2.2.1 Factorization for Undirected Models -- 2.2.2 Markov Property for Undirected Models -- 2.2.3 Hammersley-Clifford Equivalence -- 2.2.4 Factor Graphs -- 3 Exact Algorithms for Marginals, Likelihoods and Modes -- 3.1 Elimination Algorithm -- 3.1.1 Graph-Theoretic Versus Analytical Elimination -- 3.1.2 Complexity of Elimination.
3.2 Message-Passing Algorithms on Trees -- 3.2.1 Sum-Product Algorithm -- 3.2.2 Sum-Product on General Factor Trees -- 3.2.3 Max-Product Algorithm -- 4 Junction Tree Framework -- 4.1 Clique Trees and Running Intersection -- 4.2 Triangulation and Junction Trees -- 4.3 Constructing the Junction Tree -- 5 Basics of Graph Estimation -- 5.1 Parameter Estimation for Directed Graphs -- 5.2 Parameter Estimation for Undirected Graphs -- 5.2.1 Maximum Likelihood for Undirected Trees -- 5.2.2 Maximum Likelihood on General Undirected Graphs -- 5.2.3 Iterative Proportional Scaling -- 5.3 Tree Selection and the Chow-Liu Algorithm -- 6 Bibliographic Details and Remarks -- Appendix: Triangulation and Equivalent Graph-Theoretic Properties -- References -- Bridging the Gap Between Information Theory and WirelessNetworking -- 1 Introduction -- 2 Shannon's Point to Point Results -- 3 The Multiple-Access and Gaussian Broadcast Channels -- 4 A Spatial Model of a Wireless Network -- 5 Multi-Hop Transport -- 6 The Transport Capacity -- 7 Best Case Transport Capacity and Scaling Laws -- 8 An Upper Bound on Transport Capacity -- 9 Implication of Square-Root Law for Transport Capacity -- 10 The Need for an Information-Theoretic Analysis -- 11 Wireless Network Information Theory -- 12 Information-Theoretic Definition of Transport Capacity -- 13 Information-Theoretic Bounds -- 14 Implication of Information-Theoretic Scaling Law -- 15 Extensions -- References -- Lecture Notes in Math ematics. |
Record Nr. | UNINA-9910131281503321 |
Kumar P.R | ||
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|