Domination number of middle graphs
In this paper, we study the domination number of middle graphs. Indeed, we obtain tight bounds for this number in terms of the order of the graph G. We also compute the domination number of some families of graphs such as star graphs, double start graphs, path graphs, cycle graphs, wheel graphs, com...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Isfahan
2023-06-01
|
| Series: | Transactions on Combinatorics |
| Subjects: | |
| Online Access: | https://toc.ui.ac.ir/article_26638_a7b1e622bfa064e433c9ef552f5757e0.pdf |
| _version_ | 1811250663970045952 |
|---|---|
| author | Farshad Kazemnejad Behnaz Pahlavsay Elisa Palezzato Michele Torielli |
| author_facet | Farshad Kazemnejad Behnaz Pahlavsay Elisa Palezzato Michele Torielli |
| author_sort | Farshad Kazemnejad |
| collection | DOAJ |
| description | In this paper, we study the domination number of middle graphs. Indeed, we obtain tight bounds for this number in terms of the order of the graph G. We also compute the domination number of some families of graphs such as star graphs, double start graphs, path graphs, cycle graphs, wheel graphs, complete graphs, complete bipartite graphs and friendship graphs, explicitly. Moreover, some Nordhaus-Gaddum-like relations are presented for the domination number of middle graphs. |
| first_indexed | 2024-04-12T16:08:03Z |
| format | Article |
| id | doaj.art-6a008674255043fc83b9af61320dbfc1 |
| institution | Directory Open Access Journal |
| issn | 2251-8657 2251-8665 |
| language | English |
| last_indexed | 2024-04-12T16:08:03Z |
| publishDate | 2023-06-01 |
| publisher | University of Isfahan |
| record_format | Article |
| series | Transactions on Combinatorics |
| spelling | doaj.art-6a008674255043fc83b9af61320dbfc12022-12-22T03:26:00ZengUniversity of IsfahanTransactions on Combinatorics2251-86572251-86652023-06-01122799110.22108/toc.2022.131151.192726638Domination number of middle graphsFarshad Kazemnejad0Behnaz Pahlavsay1Elisa Palezzato2Michele Torielli3Department of Mathematics, School of Sciences, Ilam University, P.O.Box 69315-516, Ilam, Iran.Department of Mathematics, Hokkaido University, Kita 10, Nishi 8, Kita-Ku, Sapporo 060-0810, Japan.Department of Mathematics, Hokkaido University, Kita 10, Nishi 8, Kita-Ku, Sapporo 060-0810, Japan.Hokkaido University, Department of MathematicsIn this paper, we study the domination number of middle graphs. Indeed, we obtain tight bounds for this number in terms of the order of the graph G. We also compute the domination number of some families of graphs such as star graphs, double start graphs, path graphs, cycle graphs, wheel graphs, complete graphs, complete bipartite graphs and friendship graphs, explicitly. Moreover, some Nordhaus-Gaddum-like relations are presented for the domination number of middle graphs.https://toc.ui.ac.ir/article_26638_a7b1e622bfa064e433c9ef552f5757e0.pdfdominationmiddle graphnordhaus-gaddum |
| spellingShingle | Farshad Kazemnejad Behnaz Pahlavsay Elisa Palezzato Michele Torielli Domination number of middle graphs Transactions on Combinatorics domination middle graph nordhaus-gaddum |
| title | Domination number of middle graphs |
| title_full | Domination number of middle graphs |
| title_fullStr | Domination number of middle graphs |
| title_full_unstemmed | Domination number of middle graphs |
| title_short | Domination number of middle graphs |
| title_sort | domination number of middle graphs |
| topic | domination middle graph nordhaus-gaddum |
| url | https://toc.ui.ac.ir/article_26638_a7b1e622bfa064e433c9ef552f5757e0.pdf |
| work_keys_str_mv | AT farshadkazemnejad dominationnumberofmiddlegraphs AT behnazpahlavsay dominationnumberofmiddlegraphs AT elisapalezzato dominationnumberofmiddlegraphs AT micheletorielli dominationnumberofmiddlegraphs |