• Home
  • Browse
    • Current Issue
    • By Issue
    • By Author
    • By Subject
    • Author Index
    • Keyword Index
  • Journal Info
    • About Journal
    • Aims and Scope
    • Editorial Board
    • Advisory Board
    • Editorial Staff
    • Publication Ethics
    • Indexing and Abstracting
    • Related Links
    • FAQ
    • Peer Review Process
    • News
  • Guide for Authors
  • Submit Manuscript
  • Reviewers
  • Contact Us
 
  • Login
  • Register
Home Articles List Article Information
  • Save Records
  • |
  • Printable Version
  • |
  • Recommend
  • |
  • How to cite Export to
    RIS EndNote BibTeX APA MLA Harvard Vancouver
  • |
  • Share Share
    CiteULike Mendeley Facebook Google LinkedIn Twitter Telegram
Transactions on Combinatorics
Articles in Press
Current Issue
Journal Archive
Volume Volume 8 (2019)
Issue Issue 1
Volume Volume 7 (2018)
Volume Volume 6 (2017)
Volume Volume 5 (2016)
Volume Volume 4 (2015)
Volume Volume 3 (2014)
Volume Volume 2 (2013)
Volume Volume 1 (2012)
Kharazi, H., Mosleh Tehrani, A. (2019). On the defensive alliances in graph. Transactions on Combinatorics, 8(1), 1-14. doi: 10.22108/toc.2018.50156.1396
Hasan Kharazi; Alireza Mosleh Tehrani. "On the defensive alliances in graph". Transactions on Combinatorics, 8, 1, 2019, 1-14. doi: 10.22108/toc.2018.50156.1396
Kharazi, H., Mosleh Tehrani, A. (2019). 'On the defensive alliances in graph', Transactions on Combinatorics, 8(1), pp. 1-14. doi: 10.22108/toc.2018.50156.1396
Kharazi, H., Mosleh Tehrani, A. On the defensive alliances in graph. Transactions on Combinatorics, 2019; 8(1): 1-14. doi: 10.22108/toc.2018.50156.1396

On the defensive alliances in graph

Article 1, Volume 8, Issue 1, March 2019, Page 1-14  XML PDF (262 K)
Document Type: Research Paper
DOI: 10.22108/toc.2018.50156.1396
Authors
Hasan Kharazi; Alireza Mosleh Tehrani
Department of Mathematics, Faculty of Science, Iran University of Science and Technology, Tehran, Iran.
Abstract
‎Let $ G = (V,E) $ be a graph‎. ‎We say that $ S \subseteq V $ is a defensive alliance if for every $ u \in S $‎, ‎the number of neighbors $ u $ has in $ S $ plus one (counting $ u $) is at least as large as the number of neighbors it has outside $ S $‎. ‎Then‎, ‎for every vertex $ u $ in a defensive alliance $ S $‎, ‎any attack on a single vertex by the neighbors of $ u $ in $ V-S $ can be thwarted by the neighbors of $ u $ in $ S $ and $ u $ itself‎. ‎In this paper‎, ‎we study alliances that are containing a given vertex $ u $ and study their mathematical properties‎.
Keywords
‎Defensive alliance; Alliances in graphs; Edge cut
Main Subjects
05C99 None of the above, but in this section
Statistics
Article View: 18
PDF Download: 85
Home | Glossary | News | Aims and Scope | Sitemap
Top Top

Journal Management System. Designed by sinaweb.