Total outer-convex domination number of graphs

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

Yangyang Rubelyn; Tarongoy Marylin; Revilla Evangelyn; Banlasan Rona Mae; Dayap Jonecis

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: COMMUNICATIONS IN COMBINATORICS AND OPTIMIZATION Year:2022 | Volume:7 | Issue:1 Page(s): 59-68

Download Full-Text

View:

126

Download:

Cites:

Information Journal Paper

Title

Total outer-convex domination number of graphs

Author(s)

Keywords

Domination number

total domination number

convex domination

total outer-convex domination number

grid graphs

Abstract

In this paper, we initiate the study of total outer-convex domination as a new variant of graph domination and we show the close relationship that exists between this novel parameter and other domination parameters of a graph such as total domination, convex domination, and outer-convex domination. Furthermore, we obtain general bounds of total outer-convex Domination number and, for some particular families of graphs, we obtain closed formulas.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

Yangyang, Rubelyn, Tarongoy, Marylin, Revilla, Evangelyn, Banlasan, Rona Mae, & Dayap, Jonecis. (2022). Total outer-convex domination number of graphs. COMMUNICATIONS IN COMBINATORICS AND OPTIMIZATION, 7(1), 59-68. SID. https://sid.ir/paper/704518/en

Vancouver: Copy

Yangyang Rubelyn, Tarongoy Marylin, Revilla Evangelyn, Banlasan Rona Mae, Dayap Jonecis. Total outer-convex domination number of graphs. COMMUNICATIONS IN COMBINATORICS AND OPTIMIZATION[Internet]. 2022;7(1):59-68. Available from: https://sid.ir/paper/704518/en

IEEE: Copy

Rubelyn Yangyang, Marylin Tarongoy, Evangelyn Revilla, Rona Mae Banlasan, and Jonecis Dayap, “Total outer-convex domination number of graphs,” COMMUNICATIONS IN COMBINATORICS AND OPTIMIZATION, vol. 7, no. 1, pp. 59–68, 2022, [Online]. Available: https://sid.ir/paper/704518/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops