DSpace Repository
Congruent Domination Number of Graphs Obtained by Means of Some Graph Operation
JavaScript is disabled for your browser. Some features of this site may not work without it.
| dc.contributor.author | Jadeja, M. R. | |
| dc.contributor.author | Vadhel, H. D. | |
| dc.contributor.author | Parmar, A. D. | |
| dc.date.accessioned | 2024-11-25T05:58:09Z | |
| dc.date.available | 2024-11-25T05:58:09Z | |
| dc.date.issued | 2023 | |
| dc.identifier.citation | M. R. Jadeja H. D. Vadhel, A. D. Parmar,Congruent Domination Number of Graphs Obtained by Means of Some Graph Operation,Journal of Applied Science and Computations Volume X, Issue VIII,August/2023 ISSN NO: 1076-5131 Page No: 62 | en_US |
| dc.identifier.uri | http://10.9.150.37:8080/dspace//handle/atmiyauni/1996 | |
| dc.description.abstract | Abstract A dominating set is said to be a congruent dominating set of a graph if . The minimum cardinality of a minimal congruent dominating set of is called the congruent domination number of which is denoted by . In this paper, we investigate congruent domination number of some graphs obtained by means of some graph operation. | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | Journal of Applied Science and Computations | en_US |
| dc.subject | Dominating Set | en_US |
| dc.subject | , Dominatio Numbner | en_US |
| dc.subject | Congruent Dominating Set | en_US |
| dc.subject | Congruent Domination Number | en_US |
| dc.title | Congruent Domination Number of Graphs Obtained by Means of Some Graph Operation | en_US |
| dc.type | Article | en_US |
