TOTAL [1, K]-DOMINATING SETS OF SOME GRAPH PRODUCTS

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.

Sharifani Pouyeh; Hooshmandasl Mohammad Reza

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

Seminar Paper

Paper Information

Seminar: IRANIAN ALGEBRA SEMINAR
Year:2016 | Issue:25

Download Full-Text

View:

130

Download:

Information Seminar Paper

Title

TOTAL [1, K]-DOMINATING SETS OF SOME GRAPH PRODUCTS

Author(s)

Sharifani Pouyeh | Hooshmandasl Mohammad Reza

Keywords

DOMINATION

TOTAL DOMINATION

TOTAL [1

K]-SET

CARTESIAN PRODUCTS; STRONG PRODUCTS

Abstract

FOR TWO GIVEN NON-NEGATIVE INTEGERS J AND K, A DOMINATING SET S OF A GRAPH G IS A TOTAL [J, K] -SET IF EACH VERTEX OF V (G) IS DOMINATED BY AT LEAST J, BUT NOT MORE THAN K VERTICES OF S. THE CARDINALITY OF THE SMALLEST SUCH SET IS DENOTED BY G[J, K](G). IN THIS PAPER, WE INVESTIGATE THE EXISTENCE OF SUCH DOMINATIONS FOR CORONA PRODUCT OF GRAPHS. MOREOVER, WE DESCRIBE TOTAL [1, K] -SETS OF CARTESIAN PRODUCTS GH FOR ARBITRARY GRAPHS G AND H. ALSO, WE GIVE SOME SUFFICIENT CONDITIONS FOR G AND H SUCH THAT THE STRONG PRODUCT G H HAS A TOTAL [1, K] -SET.

Cites

No record.

References

No record.

Cite

APA: Copy

Sharifani, Pouyeh, & Hooshmandasl, Mohammad Reza. (2016). TOTAL [1, K]-DOMINATING SETS OF SOME GRAPH PRODUCTS. IRANIAN ALGEBRA SEMINAR. SID. https://sid.ir/paper/938747/en

Vancouver: Copy

Sharifani Pouyeh, Hooshmandasl Mohammad Reza. TOTAL [1, K]-DOMINATING SETS OF SOME GRAPH PRODUCTS. 2016. Available from: https://sid.ir/paper/938747/en

IEEE: Copy

Pouyeh Sharifani, and Mohammad Reza Hooshmandasl, “TOTAL [1, K]-DOMINATING SETS OF SOME GRAPH PRODUCTS,” presented at the IRANIAN ALGEBRA SEMINAR. 2016, [Online]. Available: https://sid.ir/paper/938747/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops