Irregularity in Graphs
Irregularity in Graphs

Author: Akbar Ali

Publisher: Springer Nature

Published: 2021-05-20

Total Pages: 109

ISBN-13: 3030679934

DOWNLOAD EBOOK

Die Theorie der regularen Graphen (The Theory of Regular Graphs), written by the Danish Mathematician Julius Petersen in 1891, is often considered the first strictly theoretical paper dealing with graphs. In the 130 years since then, regular graphs have been a common and popular area of study. While regular graphs are typically considered to be graphs whose vertices all have the same degree, a more general interpretation is that of graphs possessing some common characteristic throughout their structure. During the past several decades, however, there has been some increased interest in investigating graphs possessing a property that is, in a sense, opposite to regularity. It is this topic with which this book deals, giving rise to a study of what might be called irregularity in graphs. Here, various irregularity concepts dealing with several topics in graph theory are described, such as degrees of vertices, graph labelings, weightings, colorings, graph structures, Eulerian and Hamiltonian properties, graph decompositions, and Ramsey-type problems.

Recent Results in the Theory of Graph Spectra
Recent Results in the Theory of Graph Spectra

Author: D.M. Cvetkovic

Publisher: Elsevier

Published: 1988-01-01

Total Pages: 319

ISBN-13: 0080867766

DOWNLOAD EBOOK

The purpose of this volume is to review the results in spectral graph theory which have appeared since 1978.The problem of characterizing graphs with least eigenvalue -2 was one of the original problems of spectral graph theory. The techniques used in the investigation of this problem have continued to be useful in other contexts including forbidden subgraph techniques as well as geometric methods involving root systems. In the meantime, the particular problem giving rise to these methods has been solved almost completely. This is indicated in Chapter 1.The study of various combinatorial objects (including distance regular and distance transitive graphs, association schemes, and block designs) have made use of eigenvalue techniques, usually as a method to show the nonexistence of objects with certain parameters. The basic method is to construct a graph which contains the structure of the combinatorial object and then to use the properties of the eigenvalues of the graph. Methods of this type are given in Chapter 2.Several topics have been included in Chapter 3, including the relationships between the spectrum and automorphism group of a graph, the graph isomorphism and the graph reconstruction problem, spectra of random graphs, and the Shannon capacity problem. Some graph polynomials related to the characteristic polynomial are described in Chapter 4. These include the matching, distance, and permanental polynomials. Applications of the theory of graph spectra to Chemistry and other branches of science are described from a mathematical viewpoint in Chapter 5. The last chapter is devoted to the extension of the theory of graph spectra to infinite graphs.

A Study of Regular and Irregular Neutrosophic Graphs with Real Life Applications
A Study of Regular and Irregular Neutrosophic Graphs with Real Life Applications

Author: Liangsong Huang

Publisher: Infinite Study

Published:

Total Pages: 20

ISBN-13:

DOWNLOAD EBOOK

Fuzzy graph theory is a useful and well-known tool to model and solve many real-life optimization problems. Since real-life problems are often uncertain due to inconsistent and indeterminate information, it is very hard for an expert to model those problems using a fuzzy graph. A neutrosophic graph can deal with the uncertainty associated with the inconsistent and indeterminate information of any real-world problem, where fuzzy graphs may fail to reveal satisfactory results.

Spectral Radius of Graphs
Spectral Radius of Graphs

Author: Dragan Stevanovic

Publisher: Academic Press

Published: 2014-10-13

Total Pages: 167

ISBN-13: 0128020970

DOWNLOAD EBOOK

Spectral Radius of Graphs provides a thorough overview of important results on the spectral radius of adjacency matrix of graphs that have appeared in the literature in the preceding ten years, most of them with proofs, and including some previously unpublished results of the author. The primer begins with a brief classical review, in order to provide the reader with a foundation for the subsequent chapters. Topics covered include spectral decomposition, the Perron-Frobenius theorem, the Rayleigh quotient, the Weyl inequalities, and the Interlacing theorem. From this introduction, the book delves deeper into the properties of the principal eigenvector; a critical subject as many of the results on the spectral radius of graphs rely on the properties of the principal eigenvector for their proofs. A following chapter surveys spectral radius of special graphs, covering multipartite graphs, non-regular graphs, planar graphs, threshold graphs, and others. Finally, the work explores results on the structure of graphs having extreme spectral radius in classes of graphs defined by fixing the value of a particular, integer-valued graph invariant, such as: the diameter, the radius, the domination number, the matching number, the clique number, the independence number, the chromatic number or the sequence of vertex degrees. Throughout, the text includes the valuable addition of proofs to accompany the majority of presented results. This enables the reader to learn tricks of the trade and easily see if some of the techniques apply to a current research problem, without having to spend time on searching for the original articles. The book also contains a handful of open problems on the topic that might provide initiative for the reader's research. - Dedicated coverage to one of the most prominent graph eigenvalues - Proofs and open problems included for further study - Overview of classical topics such as spectral decomposition, the Perron-Frobenius theorem, the Rayleigh quotient, the Weyl inequalities, and the Interlacing theorem

MATHEMATICAL COMBINATORICS (INTERNATIONAL BOOK SERIES)
MATHEMATICAL COMBINATORICS (INTERNATIONAL BOOK SERIES)

Author: Linfan MAO

Publisher: Infinite Study

Published: 2013

Total Pages: 135

ISBN-13:

DOWNLOAD EBOOK

The mathematical combinatorics is a subject that applying combinatorial notion to all mathematics and all sciences for understanding the reality of things in the universe, motivated by CC Conjecture of Dr.Linfan MAO on mathematical sciences. TheMathematical Combinatorics (International Book Series) is a fully refereed international book series with an ISBN number on each issue, sponsored by the MADIS of Chinese Academy of Sciences and published in USA quarterly, which publishes original research papers and survey articles in all aspects of mathematical combinatorics, Smarandachemulti-spaces, Smarandache geometries, non-Euclidean geometry, topology and their applications to other sciences.

Data Science and Security
Data Science and Security

Author: Dharm Singh Jat

Publisher: Springer Nature

Published: 2020-07-31

Total Pages: 321

ISBN-13: 9811553092

DOWNLOAD EBOOK

This book presents best selected papers presented at the International Conference on Data Science for Computational Security (IDSCS 2020), organized by the Department of Data Science, CHRIST (Deemed to be University), Pune Lavasa Campus, India, during 13–14 March 2020. The proceeding will be targeting the current research works in the areas of data science, data security, data analytics, artificial intelligence, machine learning, computer vision, algorithms design, computer networking, data mining, big data, text mining, knowledge representation, soft computing and cloud computing.

Data Analytics on Graphs
Data Analytics on Graphs

Author: Ljubisa Stankovic

Publisher:

Published: 2020-12-22

Total Pages: 556

ISBN-13: 9781680839821

DOWNLOAD EBOOK

Aimed at readers with a good grasp of the fundamentals of data analytics, this book sets out the fundamentals of graph theory and the emerging mathematical techniques for the analysis of a wide range of data acquired on graph environments. This book will be a useful friend and a helpful companion to all involved in data gathering and analysis.

m−Polar Fuzzy Graphs
m−Polar Fuzzy Graphs

Author: Muhammad Akram

Publisher: Springer

Published: 2018-11-13

Total Pages: 313

ISBN-13: 3030037517

DOWNLOAD EBOOK

This book provides readers with an introduction to m-polar fuzzy graphs and m-polar fuzzy hypergraphs, covering both theories and applications. A special emphasis is given to m-polar fuzzy graphs at the aim of filling a gap in the literature, namely the absence of a mathematical approach to analyze multi-index, multipolar, and multi-attribute data. The book describes metrics and labeling in m-polar graphs, m-polar fuzzy matroids. It also discusses in detail important applications in decision-making problems and imaging processing. The book is expected to stimulate the curiosity of mathematics, computer scientists, and social scientists alike, and to provide both students and researchers with the necessary knowledge to understand and apply m−polar fuzzy graph theory.

Fuzzy Graph Theory
Fuzzy Graph Theory

Author: Sunil Mathew

Publisher: Springer

Published: 2017-12-30

Total Pages: 331

ISBN-13: 3319714074

DOWNLOAD EBOOK

This book provides a timely overview of fuzzy graph theory, laying the foundation for future applications in a broad range of areas. It introduces readers to fundamental theories, such as Craine’s work on fuzzy interval graphs, fuzzy analogs of Marczewski’s theorem, and the Gilmore and Hoffman characterization. It also introduces them to the Fulkerson and Gross characterization and Menger’s theorem, the applications of which will be discussed in a forthcoming book by the same authors. This book also discusses in detail important concepts such as connectivity, distance and saturation in fuzzy graphs. Thanks to the good balance between the basics of fuzzy graph theory and new findings obtained by the authors, the book offers an excellent reference guide for advanced undergraduate and graduate students in mathematics, engineering and computer science, and an inspiring read for all researchers interested in new developments in fuzzy logic and applied mathematics.

Quantitative Graph Theory
Quantitative Graph Theory

Author: Matthias Dehmer

Publisher: CRC Press

Published: 2014-10-27

Total Pages: 530

ISBN-13: 1466584513

DOWNLOAD EBOOK

The first book devoted exclusively to quantitative graph theory, Quantitative Graph Theory: Mathematical Foundations and Applications presents and demonstrates existing and novel methods for analyzing graphs quantitatively. Incorporating interdisciplinary knowledge from graph theory, information theory, measurement theory, and statistical techniques, this book covers a wide range of quantitative-graph theoretical concepts and methods, including those pertaining to real and random graphs such as: Comparative approaches (graph similarity or distance) Graph measures to characterize graphs quantitatively Applications of graph measures in social network analysis and other disciplines Metrical properties of graphs and measures Mathematical properties of quantitative methods or measures in graph theory Network complexity measures and other topological indices Quantitative approaches to graphs using machine learning (e.g., clustering) Graph measures and statistics Information-theoretic methods to analyze graphs quantitatively (e.g., entropy) Through its broad coverage, Quantitative Graph Theory: Mathematical Foundations and Applications fills a gap in the contemporary literature of discrete and applied mathematics, computer science, systems biology, and related disciplines. It is intended for researchers as well as graduate and advanced undergraduate students in the fields of mathematics, computer science, mathematical chemistry, cheminformatics, physics, bioinformatics, and systems biology.