Minimum Dominating Color Energy of a Graph
Author: P.Siva Kota Reddy
Publisher: Infinite Study
Published:
Total Pages: 10
ISBN-13:
DOWNLOAD EBOOKWe establish the bounds for minimum dominating color energy.
Posts
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.
Minimum Equitable Dominating Randi´c Energy of a Graph
Author: Rajendra P.
Publisher: Infinite Study
Published:
Total Pages: 12
ISBN-13:
DOWNLOAD EBOOKRecently, Adiga, et.al. introduced, the minimum covering energy Ec(G) of a graph and S. Burcu Bozkurt, et.al. introduced, Randi´c Matrix and Randi´c Energy of a graph .
Minimum Equitable Dominating Randic Energy of a Graph
Author: P.Siva Kota Reddy
Publisher: Infinite Study
Published:
Total Pages: 9
ISBN-13:
DOWNLOAD EBOOKIn this paper, we introduce the minimum equitable dominating Randic energy of a graph and computed the minimum dominating Randic energy of graph. Also, established the upper and lower bounds for the minimum equitable dominating Randic energy of a graph.
Contemporary Studies in Discrete Mathematics
Author: K.A. Germina
Publisher: Sudev Naduvath
Published: 2017-10-20
Total Pages: 77
ISBN-13:
DOWNLOAD EBOOKIt is the book version of the e-journal "Contemporary Studies in Discrete Mathematics" published by Contemporary Studies in Discrete Mathematics, Thrissur, India.
MATHEMATICAL COMBINATORICS, Vol. 4 / 2017
Author: Linfan Mao
Publisher: Infinite Study
Published:
Total Pages: 167
ISBN-13: 1599735407
DOWNLOAD EBOOKThe Mathematical Combinatorics (International Book Series) is a fully refereed international book series with ISBN number on each issue, sponsored by the MADIS of Chinese Academy of Sciences and published in USA quarterly comprising 110-160 pages approx. per volume, which publishes original research papers and survey articles in all aspects of Smarandache multi-spaces, Smarandache geometries, mathematical combinatorics, non-euclidean geometry and topology and their applications to other sciences.
International Journal of Mathematical Combinatorics, Volume 4, 2017
Author: Linfan Mao
Publisher: Infinite Study
Published:
Total Pages: 167
ISBN-13:
DOWNLOAD EBOOKTopics in detail to be covered are: Smarandache multi-spaces with applications to other sciences, such as those of algebraic multi-systems, multi-metric spaces; Smarandache geometries; Differential Geometry; Geometry on manifolds; Topological graphs; Algebraic graphs; Random graphs; Combinatorial maps; Graph and map enumeration; Combinatorial designs; Combinatorial enumeration; Low Dimensional Topology; Differential Topology; Topology of Manifolds; Geometrical aspects of Mathematical Physics and Relations with Manifold Topology; Applications of Smarandache multi-spaces to theoretical physics; Applications of Combinatorics to mathematics and theoretical physics.
Chromatic Graph Theory
Author: Gary Chartrand
Publisher: CRC Press
Published: 2019-11-28
Total Pages: 450
ISBN-13: 042979827X
DOWNLOAD EBOOKWith Chromatic Graph Theory, Second Edition, the authors present various fundamentals of graph theory that lie outside of graph colorings, including basic terminology and results, trees and connectivity, Eulerian and Hamiltonian graphs, matchings and factorizations, and graph embeddings. Readers will see that the authors accomplished the primary goal of this textbook, which is to introduce graph theory with a coloring theme and to look at graph colorings in various ways. The textbook also covers vertex colorings and bounds for the chromatic number, vertex colorings of graphs embedded on surfaces, and a variety of restricted vertex colorings. The authors also describe edge colorings, monochromatic and rainbow edge colorings, complete vertex colorings, several distinguishing vertex and edge colorings. Features of the Second Edition: The book can be used for a first course in graph theory as well as a graduate course The primary topic in the book is graph coloring The book begins with an introduction to graph theory so assumes no previous course The authors are the most widely-published team on graph theory Many new examples and exercises enhance the new edition
The Four-Color Theorem
Author: Rudolf Fritsch
Publisher: Springer Science & Business Media
Published: 1998
Total Pages: 294
ISBN-13: 9780387984971
DOWNLOAD EBOOKThis elegant little book discusses a famous problem that helped to define the field now known as graph theory: what is the minimum number of colors required to print a map such that no two adjoining countries have the same color, no matter how convoluted their boundaries are. Many famous mathematicians have worked on the problem, but the proof eluded formulation until the 1970s, when it was finally cracked with a brute-force approach using a computer. The Four-Color Theorem begins by discussing the history of the problem up to the new approach given in the 1990s (by Neil Robertson, Daniel Sanders, Paul Seymour, and Robin Thomas). The book then goes into the mathematics, with a detailed discussion of how to convert the originally topological problem into a combinatorial one that is both elementary enough that anyone with a basic knowledge of geometry can follow it and also rigorous enough that a mathematician can read it with satisfaction. The authors discuss the mathematics and point to the philosophical debate that ensued when the proof was announced: just what is a mathematical proof, if it takes a computer to provide one - and is such a thing a proof at all?
Color-Induced Graph Colorings
Author: Ping Zhang
Publisher: Springer
Published: 2015-08-10
Total Pages: 130
ISBN-13: 3319203940
DOWNLOAD EBOOKA comprehensive treatment of color-induced graph colorings is presented in this book, emphasizing vertex colorings induced by edge colorings. The coloring concepts described in this book depend not only on the property required of the initial edge coloring and the kind of objects serving as colors, but also on the property demanded of the vertex coloring produced. For each edge coloring introduced, background for the concept is provided, followed by a presentation of results and open questions dealing with this topic. While the edge colorings discussed can be either proper or unrestricted, the resulting vertex colorings are either proper colorings or rainbow colorings. This gives rise to a discussion of irregular colorings, strong colorings, modular colorings, edge-graceful colorings, twin edge colorings and binomial colorings. Since many of the concepts described in this book are relatively recent, the audience for this book is primarily mathematicians interested in learning some new areas of graph colorings as well as researchers and graduate students in the mathematics community, especially the graph theory community.
