On dominator and total dominator coloring of duplication corresponding corona of path, pan, complete and sunlet graphs Article Swipe
YOU?
·
· 2025
· Open Access
·
· DOI: https://doi.org/10.30538/psrp-odam2025.0113
A dominator coloring of a graph \(\mathscr{G}\) is a proper coloring where each vertex of \(\mathscr{G}\) is within the closed neighborhood of at least one vertex from each color class. The minimum number of color classes required for a dominator coloring of \(\mathscr{G}\) is termed the dominator chromatic number. Additionally, a total dominator coloring of a graph \(\mathscr{G}\) is a proper coloring in which every vertex dominates at least one color class other than its own. The minimum number of color classes needed for a total dominator coloring of \(\mathscr{G}\) is known as the total dominator chromatic number. In this paper, our objective is to derive findings concerning dominator and total dominator coloring of the duplication corresponding corona of specific graphs.
Related Topics
- Type
- article
- Language
- en
- Landing Page
- https://doi.org/10.30538/psrp-odam2025.0113
- https://pisrt.org/psrpress/j/odam/2025/2/on-dominator-and-total-dominator-coloring-of-duplication-corresponding-corona-of-path-pan-complete-and-sunlet-graphs.pdf
- OA Status
- diamond
- Related Works
- 10
- OpenAlex ID
- https://openalex.org/W4410108507
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W4410108507Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.30538/psrp-odam2025.0113Digital Object Identifier
- Title
-
On dominator and total dominator coloring of duplication corresponding corona of path, pan, complete and sunlet graphsWork title
- Type
-
articleOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2025Year of publication
- Publication date
-
2025-05-06Full publication date if available
- Authors
-
Megala Shanmugam, N. Mohanapriya, K. Ravichandran, Abirami KamarajList of authors in order
- Landing page
-
https://doi.org/10.30538/psrp-odam2025.0113Publisher landing page
- PDF URL
-
https://pisrt.org/psrpress/j/odam/2025/2/on-dominator-and-total-dominator-coloring-of-duplication-corresponding-corona-of-path-pan-complete-and-sunlet-graphs.pdfDirect link to full text PDF
- Open access
-
YesWhether a free full text is available
- OA status
-
diamondOpen access status per OpenAlex
- OA URL
-
https://pisrt.org/psrpress/j/odam/2025/2/on-dominator-and-total-dominator-coloring-of-duplication-corresponding-corona-of-path-pan-complete-and-sunlet-graphs.pdfDirect OA link when available
- Concepts
-
Path (computing), Mathematics, Complete coloring, Combinatorics, Computer science, Graph, Computer network, Line graph, Graph powerTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
0Total citation count in OpenAlex
- Related works (count)
-
10Other works algorithmically related by OpenAlex
Full payload
| id | https://openalex.org/W4410108507 |
|---|---|
| doi | https://doi.org/10.30538/psrp-odam2025.0113 |
| ids.doi | https://doi.org/10.30538/psrp-odam2025.0113 |
| ids.openalex | https://openalex.org/W4410108507 |
| fwci | 0.0 |
| type | article |
| title | On dominator and total dominator coloring of duplication corresponding corona of path, pan, complete and sunlet graphs |
| biblio.issue | 2 |
| biblio.volume | 8 |
| biblio.last_page | 31 |
| biblio.first_page | 18 |
| topics[0].id | https://openalex.org/T12541 |
| topics[0].field.id | https://openalex.org/fields/17 |
| topics[0].field.display_name | Computer Science |
| topics[0].score | 0.9976999759674072 |
| topics[0].domain.id | https://openalex.org/domains/3 |
| topics[0].domain.display_name | Physical Sciences |
| topics[0].subfield.id | https://openalex.org/subfields/1703 |
| topics[0].subfield.display_name | Computational Theory and Mathematics |
| topics[0].display_name | Graph Labeling and Dimension Problems |
| topics[1].id | https://openalex.org/T10374 |
| topics[1].field.id | https://openalex.org/fields/17 |
| topics[1].field.display_name | Computer Science |
| topics[1].score | 0.9961000084877014 |
| topics[1].domain.id | https://openalex.org/domains/3 |
| topics[1].domain.display_name | Physical Sciences |
| topics[1].subfield.id | https://openalex.org/subfields/1703 |
| topics[1].subfield.display_name | Computational Theory and Mathematics |
| topics[1].display_name | Advanced Graph Theory Research |
| topics[2].id | https://openalex.org/T11797 |
| topics[2].field.id | https://openalex.org/fields/22 |
| topics[2].field.display_name | Engineering |
| topics[2].score | 0.9767000079154968 |
| topics[2].domain.id | https://openalex.org/domains/3 |
| topics[2].domain.display_name | Physical Sciences |
| topics[2].subfield.id | https://openalex.org/subfields/2208 |
| topics[2].subfield.display_name | Electrical and Electronic Engineering |
| topics[2].display_name | graph theory and CDMA systems |
| is_xpac | False |
| apc_list | |
| apc_paid | |
| concepts[0].id | https://openalex.org/C2777735758 |
| concepts[0].level | 2 |
| concepts[0].score | 0.5109647512435913 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q817765 |
| concepts[0].display_name | Path (computing) |
| concepts[1].id | https://openalex.org/C33923547 |
| concepts[1].level | 0 |
| concepts[1].score | 0.483175665140152 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q395 |
| concepts[1].display_name | Mathematics |
| concepts[2].id | https://openalex.org/C21642379 |
| concepts[2].level | 5 |
| concepts[2].score | 0.4773940443992615 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q3342988 |
| concepts[2].display_name | Complete coloring |
| concepts[3].id | https://openalex.org/C114614502 |
| concepts[3].level | 1 |
| concepts[3].score | 0.45486822724342346 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q76592 |
| concepts[3].display_name | Combinatorics |
| concepts[4].id | https://openalex.org/C41008148 |
| concepts[4].level | 0 |
| concepts[4].score | 0.25390058755874634 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[4].display_name | Computer science |
| concepts[5].id | https://openalex.org/C132525143 |
| concepts[5].level | 2 |
| concepts[5].score | 0.07946857810020447 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q141488 |
| concepts[5].display_name | Graph |
| concepts[6].id | https://openalex.org/C31258907 |
| concepts[6].level | 1 |
| concepts[6].score | 0.06349211931228638 |
| concepts[6].wikidata | https://www.wikidata.org/wiki/Q1301371 |
| concepts[6].display_name | Computer network |
| concepts[7].id | https://openalex.org/C203776342 |
| concepts[7].level | 3 |
| concepts[7].score | 0.0 |
| concepts[7].wikidata | https://www.wikidata.org/wiki/Q1378376 |
| concepts[7].display_name | Line graph |
| concepts[8].id | https://openalex.org/C149530733 |
| concepts[8].level | 4 |
| concepts[8].score | 0.0 |
| concepts[8].wikidata | https://www.wikidata.org/wiki/Q5597091 |
| concepts[8].display_name | Graph power |
| keywords[0].id | https://openalex.org/keywords/path |
| keywords[0].score | 0.5109647512435913 |
| keywords[0].display_name | Path (computing) |
| keywords[1].id | https://openalex.org/keywords/mathematics |
| keywords[1].score | 0.483175665140152 |
| keywords[1].display_name | Mathematics |
| keywords[2].id | https://openalex.org/keywords/complete-coloring |
| keywords[2].score | 0.4773940443992615 |
| keywords[2].display_name | Complete coloring |
| keywords[3].id | https://openalex.org/keywords/combinatorics |
| keywords[3].score | 0.45486822724342346 |
| keywords[3].display_name | Combinatorics |
| keywords[4].id | https://openalex.org/keywords/computer-science |
| keywords[4].score | 0.25390058755874634 |
| keywords[4].display_name | Computer science |
| keywords[5].id | https://openalex.org/keywords/graph |
| keywords[5].score | 0.07946857810020447 |
| keywords[5].display_name | Graph |
| keywords[6].id | https://openalex.org/keywords/computer-network |
| keywords[6].score | 0.06349211931228638 |
| keywords[6].display_name | Computer network |
| language | en |
| locations[0].id | doi:10.30538/psrp-odam2025.0113 |
| locations[0].is_oa | True |
| locations[0].source.id | https://openalex.org/S4210220253 |
| locations[0].source.issn | 2617-9679, 2617-9687 |
| locations[0].source.type | journal |
| locations[0].source.is_oa | True |
| locations[0].source.issn_l | 2617-9679 |
| locations[0].source.is_core | True |
| locations[0].source.is_in_doaj | False |
| locations[0].source.display_name | Open Journal of Discrete Applied Mathematics |
| locations[0].source.host_organization | |
| locations[0].source.host_organization_name | |
| locations[0].license | cc-by |
| locations[0].pdf_url | https://pisrt.org/psrpress/j/odam/2025/2/on-dominator-and-total-dominator-coloring-of-duplication-corresponding-corona-of-path-pan-complete-and-sunlet-graphs.pdf |
| locations[0].version | publishedVersion |
| locations[0].raw_type | journal-article |
| locations[0].license_id | https://openalex.org/licenses/cc-by |
| locations[0].is_accepted | True |
| locations[0].is_published | True |
| locations[0].raw_source_name | Open Journal of Discrete Applied Mathematics |
| locations[0].landing_page_url | https://doi.org/10.30538/psrp-odam2025.0113 |
| indexed_in | crossref |
| authorships[0].author.id | https://openalex.org/A5108299677 |
| authorships[0].author.orcid | |
| authorships[0].author.display_name | Megala Shanmugam |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Megala Shanmugam |
| authorships[0].is_corresponding | False |
| authorships[1].author.id | https://openalex.org/A5018610460 |
| authorships[1].author.orcid | |
| authorships[1].author.display_name | N. Mohanapriya |
| authorships[1].author_position | middle |
| authorships[1].raw_author_name | Mohanapriya Nagaraj |
| authorships[1].is_corresponding | False |
| authorships[2].author.id | https://openalex.org/A5112228764 |
| authorships[2].author.orcid | |
| authorships[2].author.display_name | K. Ravichandran |
| authorships[2].author_position | middle |
| authorships[2].raw_author_name | Karthika Ravichandran |
| authorships[2].is_corresponding | False |
| authorships[3].author.id | https://openalex.org/A5092880075 |
| authorships[3].author.orcid | |
| authorships[3].author.display_name | Abirami Kamaraj |
| authorships[3].author_position | last |
| authorships[3].raw_author_name | Abirami Kamaraj |
| authorships[3].is_corresponding | False |
| has_content.pdf | True |
| has_content.grobid_xml | True |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | https://pisrt.org/psrpress/j/odam/2025/2/on-dominator-and-total-dominator-coloring-of-duplication-corresponding-corona-of-path-pan-complete-and-sunlet-graphs.pdf |
| open_access.oa_status | diamond |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-10-10T00:00:00 |
| display_name | On dominator and total dominator coloring of duplication corresponding corona of path, pan, complete and sunlet graphs |
| has_fulltext | False |
| is_retracted | False |
| updated_date | 2025-11-06T03:46:38.306776 |
| primary_topic.id | https://openalex.org/T12541 |
| primary_topic.field.id | https://openalex.org/fields/17 |
| primary_topic.field.display_name | Computer Science |
| primary_topic.score | 0.9976999759674072 |
| primary_topic.domain.id | https://openalex.org/domains/3 |
| primary_topic.domain.display_name | Physical Sciences |
| primary_topic.subfield.id | https://openalex.org/subfields/1703 |
| primary_topic.subfield.display_name | Computational Theory and Mathematics |
| primary_topic.display_name | Graph Labeling and Dimension Problems |
| related_works | https://openalex.org/W4391375266, https://openalex.org/W3212050749, https://openalex.org/W74836192, https://openalex.org/W1773291652, https://openalex.org/W2406999925, https://openalex.org/W4297797131, https://openalex.org/W2269413802, https://openalex.org/W2296149237, https://openalex.org/W1983048542, https://openalex.org/W3212023493 |
| cited_by_count | 0 |
| locations_count | 1 |
| best_oa_location.id | doi:10.30538/psrp-odam2025.0113 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S4210220253 |
| best_oa_location.source.issn | 2617-9679, 2617-9687 |
| best_oa_location.source.type | journal |
| best_oa_location.source.is_oa | True |
| best_oa_location.source.issn_l | 2617-9679 |
| best_oa_location.source.is_core | True |
| best_oa_location.source.is_in_doaj | False |
| best_oa_location.source.display_name | Open Journal of Discrete Applied Mathematics |
| best_oa_location.source.host_organization | |
| best_oa_location.source.host_organization_name | |
| best_oa_location.license | cc-by |
| best_oa_location.pdf_url | https://pisrt.org/psrpress/j/odam/2025/2/on-dominator-and-total-dominator-coloring-of-duplication-corresponding-corona-of-path-pan-complete-and-sunlet-graphs.pdf |
| best_oa_location.version | publishedVersion |
| best_oa_location.raw_type | journal-article |
| best_oa_location.license_id | https://openalex.org/licenses/cc-by |
| best_oa_location.is_accepted | True |
| best_oa_location.is_published | True |
| best_oa_location.raw_source_name | Open Journal of Discrete Applied Mathematics |
| best_oa_location.landing_page_url | https://doi.org/10.30538/psrp-odam2025.0113 |
| primary_location.id | doi:10.30538/psrp-odam2025.0113 |
| primary_location.is_oa | True |
| primary_location.source.id | https://openalex.org/S4210220253 |
| primary_location.source.issn | 2617-9679, 2617-9687 |
| primary_location.source.type | journal |
| primary_location.source.is_oa | True |
| primary_location.source.issn_l | 2617-9679 |
| primary_location.source.is_core | True |
| primary_location.source.is_in_doaj | False |
| primary_location.source.display_name | Open Journal of Discrete Applied Mathematics |
| primary_location.source.host_organization | |
| primary_location.source.host_organization_name | |
| primary_location.license | cc-by |
| primary_location.pdf_url | https://pisrt.org/psrpress/j/odam/2025/2/on-dominator-and-total-dominator-coloring-of-duplication-corresponding-corona-of-path-pan-complete-and-sunlet-graphs.pdf |
| primary_location.version | publishedVersion |
| primary_location.raw_type | journal-article |
| primary_location.license_id | https://openalex.org/licenses/cc-by |
| primary_location.is_accepted | True |
| primary_location.is_published | True |
| primary_location.raw_source_name | Open Journal of Discrete Applied Mathematics |
| primary_location.landing_page_url | https://doi.org/10.30538/psrp-odam2025.0113 |
| publication_date | 2025-05-06 |
| publication_year | 2025 |
| referenced_works_count | 0 |
| abstract_inverted_index.A | 0 |
| abstract_inverted_index.a | 4, 8, 38, 50, 55, 59, 84 |
| abstract_inverted_index.In | 98 |
| abstract_inverted_index.as | 92 |
| abstract_inverted_index.at | 22, 67 |
| abstract_inverted_index.in | 62 |
| abstract_inverted_index.is | 7, 16, 43, 58, 90, 103 |
| abstract_inverted_index.of | 3, 14, 21, 33, 41, 54, 79, 88, 113, 118 |
| abstract_inverted_index.to | 104 |
| abstract_inverted_index.The | 30, 76 |
| abstract_inverted_index.and | 109 |
| abstract_inverted_index.for | 37, 83 |
| abstract_inverted_index.its | 74 |
| abstract_inverted_index.one | 24, 69 |
| abstract_inverted_index.our | 101 |
| abstract_inverted_index.the | 18, 45, 93, 114 |
| abstract_inverted_index.each | 12, 27 |
| abstract_inverted_index.from | 26 |
| abstract_inverted_index.own. | 75 |
| abstract_inverted_index.than | 73 |
| abstract_inverted_index.this | 99 |
| abstract_inverted_index.class | 71 |
| abstract_inverted_index.color | 28, 34, 70, 80 |
| abstract_inverted_index.every | 64 |
| abstract_inverted_index.graph | 5, 56 |
| abstract_inverted_index.known | 91 |
| abstract_inverted_index.least | 23, 68 |
| abstract_inverted_index.other | 72 |
| abstract_inverted_index.total | 51, 85, 94, 110 |
| abstract_inverted_index.where | 11 |
| abstract_inverted_index.which | 63 |
| abstract_inverted_index.class. | 29 |
| abstract_inverted_index.closed | 19 |
| abstract_inverted_index.corona | 117 |
| abstract_inverted_index.derive | 105 |
| abstract_inverted_index.needed | 82 |
| abstract_inverted_index.number | 32, 78 |
| abstract_inverted_index.paper, | 100 |
| abstract_inverted_index.proper | 9, 60 |
| abstract_inverted_index.termed | 44 |
| abstract_inverted_index.vertex | 13, 25, 65 |
| abstract_inverted_index.within | 17 |
| abstract_inverted_index.classes | 35, 81 |
| abstract_inverted_index.graphs. | 120 |
| abstract_inverted_index.minimum | 31, 77 |
| abstract_inverted_index.number. | 48, 97 |
| abstract_inverted_index.coloring | 2, 10, 40, 53, 61, 87, 112 |
| abstract_inverted_index.findings | 106 |
| abstract_inverted_index.required | 36 |
| abstract_inverted_index.specific | 119 |
| abstract_inverted_index.chromatic | 47, 96 |
| abstract_inverted_index.dominates | 66 |
| abstract_inverted_index.dominator | 1, 39, 46, 52, 86, 95, 108, 111 |
| abstract_inverted_index.objective | 102 |
| abstract_inverted_index.concerning | 107 |
| abstract_inverted_index.duplication | 115 |
| abstract_inverted_index.neighborhood | 20 |
| abstract_inverted_index.Additionally, | 49 |
| abstract_inverted_index.corresponding | 116 |
| abstract_inverted_index.\(\mathscr{G}\) | 6, 15, 42, 57, 89 |
| cited_by_percentile_year | |
| countries_distinct_count | 0 |
| institutions_distinct_count | 4 |
| citation_normalized_percentile.value | 0.16539551 |
| citation_normalized_percentile.is_in_top_1_percent | False |
| citation_normalized_percentile.is_in_top_10_percent | False |