Minimum Dominating Color Energy Of A Graph
Download Minimum Dominating Color Energy Of A Graph PDF/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get Minimum Dominating Color Energy Of A Graph book now. This website allows unlimited access to, at the time of writing, more than 1.5 million titles, including hundreds of thousands of titles in various foreign languages.
Minimum Dominating Color Energy of a Graph
We establish the bounds for minimum dominating color energy.
INTERNATIONAL JOURNAL OF MATHEMATICAL COMBINATORICS, VOLUME 3, 2017
Author: Linfan Mao
language: en
Publisher: Infinite Study, Phoenix, United States
Release Date:
In 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.
International Journal of Mathematical Combinatorics, Volume 4, 2017
Topics 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.