On signed total domination concept of generalizedgraphs and networks
Publish Year: 1396
نوع سند: مقاله کنفرانسی
زبان: English
View: 337
This Paper With 7 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
ICIORS10_048
تاریخ نمایه سازی: 11 شهریور 1397
Abstract:
Let G=(V,E) be a graph. The function is a signed total domination function if for all vertices where is the open neighborhood of vertex v. The minimum of values of is called signed total domination number and denoted by The signed total domination concept is an lp integer programming and NP-hardness problem. In this paper, we initiate studying of signed total domination number for generalized graphs and networks.
Keywords:
Signed total domination number , Mysielski construction
Authors
Athena Shaminezhad
Department of Mathematic, International University Of Imam Khomeini, Qazvin, Iran
Arezoo N. Ghameshlou
Department of Irrigation and Reclamation, University of Tehran, Karaj, Iran