220 research outputs found
Roman Domination in Complementary Prism Graphs
A Roman domination function on a complementary prism graph GGc is a function f : V [ V c ! {0, 1, 2} such that every vertex with label 0 has a neighbor with label 2. The Roman domination number R(GGc) of a graph G = (V,E) is the minimum of Px2V [V c f(x) over such functions, where the complementary prism GGc of G is graph obtained from disjoint union of G and its complement Gc by adding edges of a perfect matching between corresponding vertices of G and Gc. In this paper, we have investigated few properties of R(GGc) and its relation with other parameters are obtaine
International Journal of Mathematical Combinatorics, Vol.6A
The International J.Mathematical Combinatorics (ISSN 1937-1055) is a fully refereed international journal, sponsored by the MADIS of Chinese Academy of Sciences and published in USA quarterly comprising 460 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
Distances and Domination in Graphs
This book presents a compendium of the 10 articles published in the recent Special Issue âDistance and Domination in Graphsâ. The works appearing herein deal with several topics on graph theory that relate to the metric and dominating properties of graphs. The topics of the gathered publications deal with some new open lines of investigations that cover not only graphs, but also digraphs. Different variations in dominating sets or resolving sets are appearing, and a review on some networksâ curvatures is also present
International Journal of Mathematical Combinatorics, Vol.6
The International J.Mathematical Combinatorics (ISSN 1937-1055) is a fully refereed international journal, sponsored by the MADIS of Chinese Academy of Sciences and published in USA quarterly comprising 460 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
An updated survey on rainbow connections of graphs - a dynamic survey
The concept of rainbow connection was introduced by Chartrand, Johns, McKeon and Zhang in 2008. Nowadays it has become a new and active subject in graph theory. There is a book on this topic by Li and Sun in 2012, and a survey paper by Li, Shi and Sun in 2013. More and more researchers are working in this field, and many new papers have been published in journals. In this survey we attempt to bring together most of the new results and papers that deal with this topic. We begin with an introduction, and then try to organize the work into the following categories, rainbow connection coloring of edge-version, rainbow connection coloring of vertex-version, rainbow -connectivity, rainbow index, rainbow connection coloring of total-version, rainbow connection on digraphs, rainbow connection on hypergraphs. This survey also contains some conjectures, open problems and questions for further study
- âŠ