JCMCC
Author:
Publisher:
Published: 2005
Total Pages: 492
ISBN-13:
DOWNLOAD EBOOKPosts
Structural Analysis of Complex Networks
Author: Matthias Dehmer
Publisher: Springer Science & Business Media
Published: 2010-10-14
Total Pages: 493
ISBN-13: 0817647899
DOWNLOAD EBOOKFilling a gap in literature, this self-contained book presents theoretical and application-oriented results that allow for a structural exploration of complex networks. The work focuses not only on classical graph-theoretic methods, but also demonstrates the usefulness of structural graph theory as a tool for solving interdisciplinary problems. Applications to biology, chemistry, linguistics, and data analysis are emphasized. The book is suitable for a broad, interdisciplinary readership of researchers, practitioners, and graduate students in discrete mathematics, statistics, computer science, machine learning, artificial intelligence, computational and systems biology, cognitive science, computational linguistics, and mathematical chemistry. It may also be used as a supplementary textbook in graduate-level seminars on structural graph analysis, complex networks, or network-based machine learning methods.
Discrete Mathematics and Theoretical Computer Science
Author: Cristian S. Calude
Publisher: Springer
Published: 2007-03-05
Total Pages: 310
ISBN-13: 3540450661
DOWNLOAD EBOOKThe refereed proceedings of the 4th International Conference on Discrete Mathematics and Theoretical Computer Science, DMTCS 2003, held in Dijon, France, in July 2003. The 18 revised full papers presented together with 5 invited papers were carefully reviewed and selected from 35 submissions. A broad variety of topics in discrete mathematics and the theory of computing is addressed including information theory, coding, algorithms, complexity, automata, computational mathematics, combinatorial computations, graph computations, algorithmic geometry, relational methods, game-theoretic methods, combinatorial optimization, and finite state systems.
Designs 2002
Author: W.D. Wallis
Publisher: Springer Science & Business Media
Published: 2013-12-01
Total Pages: 370
ISBN-13: 1461302455
DOWNLOAD EBOOKThis volume is a sequel to our 1996 compilation, Computational and Constructive Design Theory. Again we concentrate on two closely re lated aspects of the study of combinatorial designs: design construction and computer-aided study of designs. There are at least three classes of constructive problems in design theory. The first type of problem is the construction of a specific design. This might arise because that one particular case is an exception to a general rule, the last remaining case of a problem, or the smallest unknown case. A good example is the proof that there is no projective plane of parameter 10. In that case the computations involved were not different in kind from those which have been done by human brains without electronic assistance; they were merely longer. Computers have also been useful in the study of combinatorial spec trum problems: if a class of design has certain parameters, what is the set of values that the parameters can realize? In many cases, there is a recursive construction, so that the existence of a small number of "starter" designs leads to the construction of infinite classes of designs, and computers have proven very useful in finding "starter" designs.
Graphs, Matrices, and Designs
Author: Rolf S. Rees
Publisher: Routledge
Published: 2017-07-12
Total Pages: 339
ISBN-13: 1351444387
DOWNLOAD EBOOKExamines partitions and covers of graphs and digraphs, latin squares, pairwise balanced designs with prescribed block sizes, ranks and permanents, extremal graph theory, Hadamard matrices and graph factorizations. This book is designed to be of interest to applied mathematicians, computer scientists and communications researchers.
Combinatorial Designs
Author: A. Hartman
Publisher: Elsevier
Published: 1989-10-11
Total Pages: 395
ISBN-13: 0080867820
DOWNLOAD EBOOKHaim Hanani pioneered the techniques for constructing designs and the theory of pairwise balanced designs, leading directly to Wilson's Existence Theorem. He also led the way in the study of resolvable designs, covering and packing problems, latin squares, 3-designs and other combinatorial configurations.The Hanani volume is a collection of research and survey papers at the forefront of research in combinatorial design theory, including Professor Hanani's own latest work on Balanced Incomplete Block Designs. Other areas covered include Steiner systems, finite geometries, quasigroups, and t-designs.
Applied Mathematics and Scientific Computing
Author: B. Rushi Kumar
Publisher: Springer
Published: 2019-02-01
Total Pages: 608
ISBN-13: 3030011232
DOWNLOAD EBOOKThis volume is the first of two containing selected papers from the International Conference on Advances in Mathematical Sciences (ICAMS), held at the Vellore Institute of Technology in December 2017. This meeting brought together researchers from around the world to share their work, with the aim of promoting collaboration as a means of solving various problems in modern science and engineering. The authors of each chapter present a research problem, techniques suitable for solving it, and a discussion of the results obtained. These volumes will be of interest to both theoretical- and application-oriented individuals in academia and industry. Papers in Volume I are dedicated to active and open areas of research in algebra, analysis, operations research, and statistics, and those of Volume II consider differential equations, fluid mechanics, and graph theory.
Topics in Domination in Graphs
Author: Teresa W. Haynes
Publisher: Springer Nature
Published: 2020-10-19
Total Pages: 545
ISBN-13: 3030511170
DOWNLOAD EBOOKThis volume comprises 16 contributions that present advanced topics in graph domination, featuring open problems, modern techniques, and recent results. The focus is on primary dominating sets such as paired domination, connected domination, restrained domination, dominating functions, Roman domination, and power domination. Additionally, surveys include known results with a sample of proof techniques for each parameter. Of extra benefit to the reader, the first chapter includes a glossary of commonly used terms; the second chapter provides an overview of models of domination from which the parameters are defined. The book is intended to provide a reference for established researchers in the fields of domination and graph theory and graduate students who wish to gain knowledge of the topics covered as well as an overview of the major accomplishments in the field and proof techniques used.
INTERNATIONAL JOURNAL OF MATHEMATICAL COMBINATORICS, VOLUME 3, 2017
Author: Linfan Mao
Publisher: Infinite Study, Phoenix, United States
Published:
Total Pages: 146
ISBN-13:
DOWNLOAD EBOOKIn this issue, there are 12 papers following: Paper 1: Smarandache Curves of Curves lying on Lightlike Cone. Paper 2: Intuitionistic fuzzy graph. Paper 3: Smarandachely dominating. Paper 4: Cohen-Macaulay of Ideal. Paper 5: Conformal (k, μ)-Contact Manifold. Paper 6: First and second Zagreb indices. Paper 7: Number of spanning trees. Paper 8: Smarandachely strong dominating set. Paper 9: Smarandachely equitable dominating set. Paper 10: Smarandachely cordial labeling, Smarandachely cordial graph. Paper 11: Smarandachely equitable dominating set. Paper 12: Smarandachely cordial labeling.
Automated Reasoning and Mathematics
Author: Maria Paola Bonacina
Publisher: Springer
Published: 2013-02-28
Total Pages: 276
ISBN-13: 3642366759
DOWNLOAD EBOOKThis Festschrift volume is published in memory of William W. McCune who passed away in 2011. William W. McCune was an accomplished computer scientist all around but especially a fantastic system builder and software engineer. The volume includes 13 full papers, which are presenting research in all aspects of automated reasoning and its applications to mathematics. These papers have been thoroughly reviewed and selected out of 15 submissions received in response to the call for paper issued in September 2011. The topics covered are: strategies, indexing, superposition-based theorem proving, model building, application of automated reasoning to mathematics, as well as to program verification, data mining, and computer formalized mathematics.
