01706oam 2200517 450 991071309660332120200311084403.0(CKB)5470000002499232(OCoLC)985371007(OCoLC)995470000002499232(EXLCZ)99547000000249923220170503d1983 ua 0engurbn|||||||||txtrdacontentcrdamediacrrdacarrierAutomatic dilution gaging of rapidly varying flow /by Marvin D. DuerkMadison, Wisconsin :U.S. Geological Survey,1983.1 online resource (v, 17 pages) illustrations, mapsWater-resources investigations report ;83-4088"October 1983."Includes bibliographical references (page 9).Stream measurementsEquipment and suppliesFlow metersCalibrationUrban runoffMeasurementFlow metersCalibrationfastStream measurementsfastUrban runoffMeasurementfastStream measurementsEquipment and supplies.Flow metersCalibration.Urban runoffMeasurement.Flow metersCalibration.Stream measurements.Urban runoffMeasurement.Duerk Marvin D.1413852Geological Survey (U.S.),COPCOPOCLCOOCLCFGPOBOOK9910713096603321Automatic dilution gaging of rapidly varying flow3511325UNINA03591nam 22005775 450 991100745590332120250531130245.03-031-74252-410.1007/978-3-031-74252-1(CKB)39124536300041(DE-He213)978-3-031-74252-1(MiAaPQ)EBC32145189(Au-PeEL)EBL32145189(OCoLC)1522508967(EXLCZ)993912453630004120250531d2025 u| 0engur|||||||||||txtrdacontentcrdamediacrrdacarrierTopics in Combinatorics and Graph Theory /by R. Rama1st ed. 2025.Cham :Springer Nature Switzerland :Imprint: Springer,2025.1 online resource (X, 454 p. 257 illus., 1 illus. in color.) 3-031-74251-6 Basics of Counting -- Induction and Pigeon Hole Principle -- Binomial Theorem and Binomial Identities Partitions -- Permutations -- Combinations and Cycles -- Generating Functions -- Recurrence Relations -- Inclusion Exclusion Principle -- Partial Order and Lattices -- Polya’s Theory -- More on Counting -- Discrete Probability -- Basic Concepts -- Paths Connectedness -- Trees -- Connectivity -- Eulerian and Hamiltonian Graphs -- Planar Graphs -- Independent Sets -- Coverings and Matchings -- Graph Coloring -- Ramsey Numbers and Ramsey Graphs -- Spectral Properties of Graphs -- Directed Graphs and Graph Algorithms.The book covers all the basics of both the topics. The topics are sequenced in such a manner that there is a flow in understanding the advances. The first and second chapters cover all the basic methods and tools for counting. Chapter 3 is on binomial theorem and binomial identities. Topics such as partitions, permutations on multisets, generating functions, recurrence relation, principle of inclusion exclusion, repeated counting, partially ordered sets and Mobius inversion, Polya's counting are covered in different chapters. Some basic chapters have some worked-out exercise. Information on Catalan numbers, Eulerian Numbers, Narayana Numbers, and Schroder Number are given in a chapter. The topic on "discrete probability" covers the connection between counting techniques and probability theory. There second part of the book covers topics in graph theory such as basics of graphs, trees,bipartite graphs, matching , planar graphs, Euler and Hamilton graphs, graph coloring, Ramsey theory, spectral properties, and some graph algorithms.Adequate exercise and examples are provided so as to enhance the reader's interest and understanding. Some interesting concepts like high hamiltonicity, power of graphs, domination, and matrix tree theorem are introduced.Graph theoryDiscrete mathematicsProbabilitiesGraph TheoryDiscrete MathematicsProbability TheoryGraph Theory in ProbabilityGraph theory.Discrete mathematics.Probabilities.Graph Theory.Discrete Mathematics.Probability Theory.Graph Theory in Probability.511.5Rama Rauthttp://id.loc.gov/vocabulary/relators/aut1823253MiAaPQMiAaPQMiAaPQBOOK9911007455903321Topics in Combinatorics and Graph Theory4389816UNINA