Domination integrity of total graphs

Vaidya, Samir K.; Shah, Nirav H.

Advanced Search

View/Open

Publisher's Version (90.64Kb)

Date

2014

Author

Vaidya, Samir K.
Shah, Nirav H.

Metadata

Show full item record

Citation

Vaidya, S. K. & Shah, N. H. (2014). Domination integrity of total graphs. TWMS Journal of Applied and Engineering Mathematics, 4(1), 117-126.

Abstract

The domination integrity of a simple connected graph G is a measure of vulnerability of a graph. Here we determine the domination integrity of total graphs of path Pn, cycle Cn and star K1,n.

Volume

Issue

URI

http://belgelik.isikun.edu.tr/xmlui/handle/iubelgelik/2526
http://jaem.isikun.edu.tr/web/index.php/archive/81-vol4no1/110

Collections

JAEM 2014, Vol 4, No 1 [21]

The following license files are associated with this item:

Creative Commons

Except where otherwise noted, this item's license is described as info:eu-repo/semantics/openAccess