LEADER 00744oam 2200229z- 450 001 9910491051703321 005 20220411120400.0 035 $a(CKB)4100000011960195 035 $a(EXLCZ)994100000011960195 100 $a20220209c2021uuuu -u- - 101 0 $aita 200 10$aAlchimie letterarie $estudi su Loredano, Meli, Manzoni, Milo Guggino, Verga, Zena, Mazzaglia /$fMaria Di Giovanna 210 $cS. Sciascia 311 $a88-8241-525-2 517 $aAlchimie letterarie 606 $aItalian literature$xHistory and criticism 615 0$aItalian literature$xHistory and criticism. 700 $aDi Giovanna$b Maria$0448655 906 $aBOOK 912 $a9910491051703321 996 $aAlchimie letterarie$93402516 997 $aUNINA LEADER 04989nam 2200709 a 450 001 9910145763303321 005 20200520144314.0 010 $a9786613100979 010 $a9781283100977 010 $a1283100975 010 $a9781118030257 010 $a1118030257 010 $a9781118033104 010 $a1118033108 035 $a(CKB)1000000000013807 035 $a(EBL)695235 035 $a(OCoLC)705353440 035 $a(SSID)ssj0000506340 035 $a(PQKBManifestationID)11313203 035 $a(PQKBTitleCode)TC0000506340 035 $a(PQKBWorkID)10513873 035 $a(PQKB)10411932 035 $a(MiAaPQ)EBC695235 035 $a(PPN)250660210 035 $a(Perlego)2768874 035 $a(EXLCZ)991000000000013807 100 $a19910905d1992 uy 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 10$aGraphs $etheory and algorithms /$fK. Thulasiraman, M.N. S. Swamy 210 $aNew York $cWiley$dc1992 215 $a1 online resource (480 p.) 300 $a"A Wiley-Interscience publication." 311 08$a9780471513568 311 08$a0471513563 320 $aIncludes bibliographical references and indexes. 327 $aGraphs: Theory and Algorithms; Contents; PREFACE; 1 BASIC CONCEPTS; 1.1 Some Basic Definitions; 1.2 Subgraphs and Complements; 1.3 Walks, Trails, Paths, and Circuits; 1.4 Connectedness and Components of a Graph; 1.5 Operations on Graphs; 1.6 Special Graphs; 1.7 Cut-Vertices and Separable Graphs; 1.8 Isomorphism and 2-Isomorphism; 1.9 Further Reading; 1.10 Exercises; 1.11 References; 2 TREES, CUTSETS, AND CIRCUITS; 2.1 Trees, Spanning Trees, and Cospanning Trees; 2.2 k-Trees, Spanning k-Trees, and Forests; 2.3 Rank and Nullity; 2.4 Fundamental Circuits; 2.5 Cutsets; 2.6 Cuts 327 $a2.7 Fundamental Cutsets2.8 Spanning Trees, Circuits, and Cutsets; 2.9 Further Reading; 2.10 Exercises; 2.11 References; 3 EULERIAN AND HAMILTONIAN GRAPHS; 3.1 Eulerian Graphs; 3.2 Hamiltonian Graphs; 3.3 Further Reading; 3.4 Exercises; 3.5 References; 4 GRAPHS AND VECTOR SPACES; 4.1 Groups and Fields; 4.2 Vector Spaces; 4.3 Vector Space of a Graph; 4.4 Dimensions of Circuit and Cutset Subspaces; 4.5 Relationship between Circuit and Cutset Subspaces; 4.6 Orthogonality of Circuit and Cutset Subspaces; 4.7 Further Reading; 4.8 Exercises; 4.9 References; 5 DIRECTED GRAPHS 327 $a5.1 Basic Definitions and Concepts5.2 Graphs and Relations; 5.3 Directed Trees or Arborescences; 5.4 Directed Eulerian Graphs; 5.5 Directed Spanning Trees and Directed Euler Trails; 5.6 Directed Hamiltonian Graphs; 5.7 Acyclic Directed Graphs; 5.8 Tournaments; 5.9 Further Reading; 5.10 Exercises; 5.11 References; 6 MATRICES OF A GRAPH; 6.1 Incidence Matrix; 6.2 Cut Matrix; 6.3 Circuit Matrix; 6.4 Orthogonality Relation; 6.5 Submatrices of Cut, Incidence, and Circuit Matrices; 6.6 Unimodular Matrices; 6.7 The Number of Spanning Trees; 6.8 The Number of Spanning 2-Trees 327 $a6.9 The Number of Directed Spanning Trees in a Directed Graph6.10 Adjacency Matrix; 6.11 The Coates and Mason Graphs; 6.12 Further Reading; 6.13 Exercises; 6.14 References; 7 PLANARITY AND DUALITY; 7.1 Planar Graphs; 7.2 Euler's Formula; 7.3 Kuratowski's Theorem and Other Characterizations of Planarity; 7.4 Dual Graphs; 7.5 Planarity and Duality; 7.6 Further Reading; 7.7 Exercises; 7.8 References; 8 CONNECTIVITY AND MATCHING; 8.1 Connectivity or Vertex Connectivity; 8.2 Edge Connectivity; 8.3 Graphs with Prescribed Degrees; 8.4 Menger's Theorem; 8.5 Matchings 327 $a8.6 Matchings in Bipartite Graphs8.7 Matchings in General Graphs; 8.8 Further Reading; 8.9 Exercises; 8.10 References; 9 COVERING AND COLORING; 9.1 Independent Sets and Vertex Covers; 9.2 Edge Covers; 9.3 Edge Coloring and Chromatic Index; 9.4 Vertex Coloring and Chromatic Number; 9.5 Chromatic Polynomials; 9.6 The Four-Color Problem; 9.7 Further Reading; 9.8 Exercises; 9.9 References; 10 MATROIDS; 10.1 Basic Definitions; 10.2 Fundamental Properties; 10.3 Equivalent Axiom Systems; 10.4 Matroid Duality and Graphoids; 10.5 Restriction, Contraction, and Minors of a Matroid 327 $a10.6 Representability of a Matroid 330 $aThis adaptation of an earlier work by the authors is a graduate text and professional reference on the fundamentals of graph theory. It covers the theory of graphs, its applications to computer networks and the theory of graph algorithms. Also includes exercises and an updated bibliography. 606 $aGraph theory 606 $aElectric networks 606 $aAlgorithms 615 0$aGraph theory. 615 0$aElectric networks. 615 0$aAlgorithms. 676 $a511/.5 700 $aThulasiraman$b K$0104384 701 $aSwamy$b M. N. S$0522057 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910145763303321 996 $aGraphs$9835043 997 $aUNINA