AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
PDF (426.6 KB)
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Research Article | Open Access

Double total domination number in certain chemical graphs

Ana Klobučar Barišić1( )Antoaneta Klobučar2
Faculty of Mechanical Engineering and Naval Architecture, University of Zagreb, Zagreb, Croatia
Faculty of Economics, Josip Juraj Strossmayer University of Osijek, Osijek, Croatia
Show Author Information

Abstract

Let G be a graph with the vertex set V ( G ). A set D V ( G ) is a total k-dominating set if every vertex v V ( G ) has at least k neighbours in D. The total k-domination number γ k t ( G ) is the cardinality of the smallest total k-dominating set. For k = 2 the total 2-dominating set is called double total dominating set. In this paper we determine the upper and lower bounds and some exact values for double total domination number on pyrene network P Y ( n ), n 1 and hexabenzocoronene X C ( n ) n 2, where pyrene network and hexabenzocoronene are composed of congruent hexagons.

CLC number: 05C69, 05C92

References

【1】
【1】
 
 
AIMS Mathematics
Pages 19629-19640

{{item.num}}

Comments on this article

Go to comment

< Back to all reports

Review Status: {{reviewData.commendedNum}} Commended , {{reviewData.revisionRequiredNum}} Revision Required , {{reviewData.notCommendedNum}} Not Commended Under Peer Review

Review Comment

Close
Close
Cite this article:
Barišić AK, Klobučar A. Double total domination number in certain chemical graphs. AIMS Mathematics, 2022, 7(11): 19629-19640. https://doi.org/10.3934/math.20221076

143

Views

0

Downloads

5

Crossref

4

Web of Science

4

Scopus

Received: 13 July 2022
Revised: 24 August 2022
Accepted: 29 August 2022
Published: 15 November 2022
©2022 the Author(s), licensee AIMS Press.

This is an open access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0)