Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 3 of 3
Full-Text Articles in Physical Sciences and Mathematics
Private Absorbant Of Generalized De Bruijn Digraphs, B. Johnson
Private Absorbant Of Generalized De Bruijn Digraphs, B. Johnson
Applications and Applied Mathematics: An International Journal (AAM)
No abstract provided.
4-Prime Cordiality Of Some Cycle Related Graphs, R. Ponraj, Rajpal Singh, S. S. Narayanan
4-Prime Cordiality Of Some Cycle Related Graphs, R. Ponraj, Rajpal Singh, S. S. Narayanan
Applications and Applied Mathematics: An International Journal (AAM)
Recently three prime cordial labeling behavior of path, cycle, complete graph, wheel, comb, subdivison of a star, bistar, double comb, corona of tree with a vertex, crown, olive tree and other standard graphs were studied. Also four prime cordial labeling behavior of complete graph, book, flower were studied. In this paper, we investigate the four prime cordial labeling behavior of corona of wheel, gear, double cone, helm, closed helm, butterfly graph, and friendship graph.
On Strong Domination Number Of Graphs, S. K. Vaidya, S. H. Karkar
On Strong Domination Number Of Graphs, S. K. Vaidya, S. H. Karkar
Applications and Applied Mathematics: An International Journal (AAM)
A subset S of a vertex set V is called a dominating set of graph G if every vertex of V -S is dominated by some element of set S. If e is an edge with end vertices u and v and degree of u is greater than or equal to degree of v then we say u strongly dominates v. If every vertex of V - S is strongly dominated by some vertex of S then S is called strong dominating set. The minimum cardinality of a strong dominating set is called the strong domination number of graph. We …