Clique Dominating Sets of Direct Product Graph of Cayley Graphs with Arithmetic Graphs
| Autor: | M. Manjuri, B. Maheswari |
|---|---|
| Rok vydání: | 2021 |
| Předmět: |
Lévy family of graphs
Clique-sum Dense graph Cayley graph Computer science Trapezoid graph Graph theory 1-planar graph Graph Modular decomposition Treewidth Indifference graph Pathwidth Chordal graph Dominating set Graph drawing Partial k-tree Odd graph Topological graph theory Maximal independent set Split graph Arithmetic Graph product MathematicsofComputing_DISCRETEMATHEMATICS |
| Zdroj: | International Journal of Computer Applications. 174:43-49 |
| ISSN: | 0975-8887 |
| DOI: | 10.5120/ijca2021921114 |
| Popis: | Graph Theory is one of the most flourishing branches of modern Mathematics finding widest applications in all most all branches of Science & Technology. It is applied in diverse areas such as social sciences, linguistics, physical sciences, communication engineering etc. Number Theory is one of the oldest branches of Mathematics, which inherited rich contributions from almost all greatest mathematicians, ancient and modern. Every branch of mathematics employs some notion of a product that enables the combination or decomposition of its elemental structures. Product of graphs are introduced in Graph Theory very recently and developing rapidly. In this paper, we consider direct product graphs of Cayley graphs with Arithmetic graphs and present Matching dominating set of these graphs. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|