[PDF] Top 20 Results on Relatively Prime Dominating Sets in Graphs

... By a graph G = (V, E) we mean a finite undirected graph without loops or multiple edges. The order and size of G are denoted by p and q respectively. For graph theoretical terms, we refer to Harary [2] and for terms ... See full document

... difference prime labeling and proved that some snake graphs admit this kind of ...related graphs, cycle related graphs, some planar graphs, some tree graphs, fan graph, helm ... See full document

... vertex prime labeling and a 2 – regular graph with atleast two odd cycles does not have a vertex prime ...vertex prime labeling if and only if it does not have two odd ... See full document

... have prime labeling which is not settled till ...butterfly graphs is prime and also prove that star, cycle, H – graph, crown graph are strongly prime ...The prime labeling for planar ... See full document

... strongly prime graph. As every prime graph is not a strongly prime graph it is very ex- citing to investigate graph families which are strongly prime ...of prime graph which are ... See full document

... Mariasingam, Results On Hetro- cordial graphs, International Journal of Innovative Science, Engineering & Technology , ISSN ...Cordial Graphs , International Journal of Scientific Engineering and ... See full document

... Cayley graphs and enumeration of Hamilton cycles and triangles can be found in Madhavi ...a prime and it is regular. The strong domination parameter of these graphs are studied by the authors [2] and ... See full document

... of graphs. Graphs associated with certain arithmetic functions which are usually called arithmetic graphs have been studied extensively by many ...total dominating functions and basic minimal ... See full document

... Proof: Let be a prime. Then the graph is a complete graph and hence every vertex is of degree So, any single vertex set dominates all other vertices in Let where is any vertex in and p is a vertex in .Then every ... See full document

... By a graph G = (V,E ) we mean a finite undirected graph without loops and multiple edges. The order and size of G are denoted by n and m respectively. For graph theoretical terms, we refer to Harary [5] and for terms ... See full document

... Now consider the elements of By the definition of it contains non-zero even numbers. So if then is an odd number, because is an odd prime. Hence or That is the vertex is adjacent with the vertex This implies that ... See full document

... Φ is defined as the number of subsets A of { 1, 2, ..., n } such that Card A ( ) = k and gcd r ( ) A is r-relatively to n. Φ ( ) r ( ) n and Φ ( ) k r ( ) n are r-generalizations of Φ ( ) n and Φ k ( ) n defined ... See full document

... is relatively prime if gcd ( ) A = 1 and it is relatively prime to n if gcd ( A ∪ { } n ) = 1 ...are relatively prime is f n ( ) and the number of such subsets of cardinality k , ... See full document

... Each of the NTRU submissions NTRUEncrypt, NTRU-HRSS-KEM, and NTRU Prime recommend a small number of concrete parameter sets. One might plot these parameter sets on a size vs. security vs. eciency ... See full document

... Abstract. In this paper, we introduce two new concepts called dominating complementary color transversal number and total dominating complementary color transversal number of a graph. We determine relations ... See full document

... Edge-Vertex Dominating Sets of Cycles Let Dev Cn , i be the family of ev-dominating sets of Cn with cardinality i.. We investigate the ev-dominating sets of Cn.[r] ... See full document

... a relatively higher degree (3) is connected to two high-degree vertices (vertices 2 and 7), but does not contribute much in terms of covering nodes that are yet in the Uncovered Nodes List once vertices 2 and 7 ... See full document

... In this case last group has one vertex. So cycle ۱ ܖ will have odd number of vertices and hence ۱ ܖ will be tripartite. Select middle two vertices from each group of four vertices except second last group and from second ... See full document

... in graphs. A dominating set S of a graph G is said to be an isolate dominating set, if < S > has at least one isolated vertex ...isolate dominating set S is said to be minimal if no ... See full document

... Two integers are relatively prime if there only common positive integer factor is 1. Example: 4 & 19 are relatively prime Example: 21 & 37 are relatively prime.[r] ... See full document