Outer-weakly 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.

Dayap Jonecis A.; Alcantara Richard T.; Anoos Roma M.

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

Journal Paper

Paper Information

Journal: COMMUNICATIONS IN COMBINATORICS AND OPTIMIZATION Year:2020 | Volume:5 | Issue:2 Page(s): 207-215

Download Full-Text

View:

109

Download:

Cites:

Information Journal Paper

Title

Outer-weakly convex domination number of graphs

Author(s)

Dayap Jonecis A. | Alcantara Richard T. | Anoos Roma M. | Issue Writer Certificate

Keywords

convex domination

weakly-convex domination

outer-connected domination

outer-convex domination

outer-weakly convex domination

Abstract

For a given simple graph G = (V; E), a set S V is an outer-weakly convex dominating set if every vertex in V nS is adjacent to some vertex in S and V nS is a weakly convex set. The outer-weakly convex domination number of a graph G, denoted by e wcon(G), is the minimum cardinality of an outer-weakly convex dominating set of G. In this paper, we initiate the study of outer-weakly 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. Furthermore, we obtain general bounds on e wcon(G) and, for some particular families of graphs, we obtain closed formula.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

Dayap, Jonecis A., Alcantara, Richard T., & Anoos, Roma M.. (2020). Outer-weakly convex domination number of graphs. COMMUNICATIONS IN COMBINATORICS AND OPTIMIZATION, 5(2), 207-215. SID. https://sid.ir/paper/694683/en

Vancouver: Copy

Dayap Jonecis A., Alcantara Richard T., Anoos Roma M.. Outer-weakly convex domination number of graphs. COMMUNICATIONS IN COMBINATORICS AND OPTIMIZATION[Internet]. 2020;5(2):207-215. Available from: https://sid.ir/paper/694683/en

IEEE: Copy

Jonecis A. Dayap, Richard T. Alcantara, and Roma M. Anoos, “Outer-weakly convex domination number of graphs,” COMMUNICATIONS IN COMBINATORICS AND OPTIMIZATION, vol. 5, no. 2, pp. 207–215, 2020, [Online]. Available: https://sid.ir/paper/694683/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops