Log in

Relevant bibliographies by topics / Generalized domination

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers

Academic literature on the topic 'Generalized domination'

Author: Grafiati

Published: 4 June 2021

Last updated: 17 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Generalized domination.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Generalized domination"

1

KUO, JYHMIN. "ON THE TWIN DOMINATION NUMBER IN GENERALIZED DE BRUIJN AND GENERALIZED KAUTZ DIGRAPHS." Discrete Mathematics, Algorithms and Applications 02, no. 02 (2010): 199–205. http://dx.doi.org/10.1142/s1793830910000577.

Full text

Abstract:

Let V and A denote the vertex and edge sets of a digraph G. A set T ⊆V is a twin dominating set of G if for every vertex v ∈ V - T, there exist u, w ∈ T (possibly u = w) such that arcs (u, v), (v, w) ∈ A. The twin domination number γ*(G) of G is the cardinality of a minimum twin dominating set of G. In this note, we investigate the twin domination numbers of generalized de Bruijn digraph and generalized Kautz digraph. The bounds of twin domination number of special generalized Kautz digraphs are given.

APA, Harvard, Vancouver, ISO, and other styles

2

Beggas, Fairouz, Volker Turau, Mohammed Haddad, and Hamamache Kheddouci. "[1,2]-Domination in generalized Petersen graphs." Discrete Mathematics, Algorithms and Applications 11, no. 05 (2019): 1950058. http://dx.doi.org/10.1142/s1793830919500587.

Full text

Abstract:

A vertex subset [Formula: see text] of a graph [Formula: see text] is a [Formula: see text]-dominating set if each vertex of [Formula: see text] is adjacent to either one or two vertices in [Formula: see text]. The minimum cardinality of a [Formula: see text]-dominating set of [Formula: see text], denoted by [Formula: see text], is called the [Formula: see text]-domination number of [Formula: see text]. In this paper, the [Formula: see text]-domination and the [Formula: see text]-total domination numbers of the generalized Petersen graphs [Formula: see text] are determined.

APA, Harvard, Vancouver, ISO, and other styles

3

Sun, Minhong, and Zehui Shao. "On Double Domination Numbers of Generalized Petersen Graphs." Journal of Computational and Theoretical Nanoscience 13, no. 10 (2016): 6514–18. http://dx.doi.org/10.1166/jctn.2016.5595.

Full text

Abstract:

A (total) double dominating set in a graph G is a subset S ⊆ V(G) such that each vertex in V(G) is (total) dominated by at least 2 vertices in S. The (total) double domination number of G is the minimum size of a (total) double dominating set of G. We determine the total double domination numbers and give upper bounds for double domination numbers of generalized Petersen graphs. By applying an integer programming model for double domination numbers of a graph, we have determined some exact values of double domination numbers of these generalized Petersen graphs with small parameters. The resul

APA, Harvard, Vancouver, ISO, and other styles

4

Shaheen, Ramy, Mohammad Assaad, and Ali Kassem. "On Eternal Domination of Generalized J s , m." Journal of Applied Mathematics 2021 (March 17, 2021): 1–7. http://dx.doi.org/10.1155/2021/8882598.

Full text

Abstract:

An eternal dominating set of a graph G is a set of guards distributed on the vertices of a dominating set so that each vertex can be occupied by one guard only. These guards can defend any infinite series of attacks, an attack is defended by moving one guard along an edge from its position to the attacked vertex. We consider the “all guards move” of the eternal dominating set problem, in which one guard has to move to the attacked vertex, and all the remaining guards are allowed to move to an adjacent vertex or stay in their current positions after each attack in order to form a dominating set

APA, Harvard, Vancouver, ISO, and other styles

5

Shaheen, Ramy, and Ali Kassem. "Eternal Domination of Generalized Petersen Graph." Journal of Applied Mathematics 2021 (January 25, 2021): 1–10. http://dx.doi.org/10.1155/2021/6627272.

Full text

Abstract:

An eternal dominating set of a graph G is a set of guards distributed on the vertices of a dominating set so that each vertex can be occupied by one guard only. These guards can defend any infinite series of attacks; an attack is defended by moving one guard along an edge from its position to the attacked vertex. We consider the “all guards move” of the eternal dominating set problem, in which one guard has to move to the attacked vertex and all the remaining guards are allowed to move to an adjacent vertex or stay in their current positions after each attack in order to form a dominating set

APA, Harvard, Vancouver, ISO, and other styles

6

Bange, D. W., A. E. Barkauskas, L. H. Host, and P. J. Slater. "Generalized domination and efficient domination in graphs." Discrete Mathematics 159, no. 1-3 (1996): 1–11. http://dx.doi.org/10.1016/0012-365x(95)00094-d.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Zhao, Taiyin, Gohar Ali, Nabila Hameed, Syed Inayat Ali Shah, and Yu-Ming Chu. "The Numerical Invariants concerning the Total Domination for Generalized Petersen Graphs." Journal of Mathematics 2020 (October 24, 2020): 1–5. http://dx.doi.org/10.1155/2020/5473675.

Full text

Abstract:

A subset S of V G is called a total dominating set of a graph G if every vertex in V G is adjacent to a vertex in S . The total domination number of a graph G denoted by γ t G is the minimum cardinality of a total dominating set in G . The maximum order of a partition of V G into total dominating sets of G is called the total domatic number of G and is denoted by d t G . Domination in graphs has applications to several fields. Domination arises in facility location problems, where the number of facilities (e.g., hospitals and fire stations) is fixed, and one attempts to minimize the distance t

APA, Harvard, Vancouver, ISO, and other styles

8

Ramezani, F., E. D. Rodríguez-Bazan, and J. A. Rodríguez-Velázquez. "On the roman domination number of generalized Sierpiński graphs." Filomat 31, no. 20 (2017): 6515–28. http://dx.doi.org/10.2298/fil1720515r.

Full text

Abstract:

A map f : V?(0,1,2) is a Roman dominating function on a graph G = (V,E) if for every vertex v ? V with f(v)=0, there exists a vertex u, adjacent to v, such that f(u)=2. The weight of a Roman dominating function is given by f(V)=?u?V f(u). The minimum weight among all Roman dominating functions on G is called the Roman domination number of G. In this article we study the Roman domination number of Generalized Sierpi?ski graphs S(G,t). More precisely, we obtain a general upper bound on the Roman domination number of S(G,t) and discuss the tightness of this bound. In particular, we focus on the c

APA, Harvard, Vancouver, ISO, and other styles

9

Gao, Hong, Changqing Xi, Kun Li, Qingfang Zhang, and Yuansheng Yang. "The Italian Domination Numbers of Generalized Petersen Graphs P(n,3)." Mathematics 7, no. 8 (2019): 714. http://dx.doi.org/10.3390/math7080714.

Full text

Abstract:

An Italian dominating function of G is a function f : V ( G ) → { 0 , 1 , 2 } , for every vertex v such that f ( v ) = 0 , it holds that ∑ u ∈ N ( v ) f ( u ) ≥ 2 . The Italian domination number γ I ( G ) is the minimum weight of an Italian dominating function on G. In this paper, we determine the exact values of the Italian domination numbers of P ( n , 3 ) .

APA, Harvard, Vancouver, ISO, and other styles

10

Kuo, Jyhmin, and Wei-Lun Wu. "Power domination in generalized undirected de Bruijn graphs and Kautz graphs." Discrete Mathematics, Algorithms and Applications 07, no. 01 (2015): 1550003. http://dx.doi.org/10.1142/s1793830915500032.

Full text

Abstract:

To monitor an electric power system by placing as few phase measurement units (PMUs) as possible is closely related to the famous vertex cover problem and domination problem in graph theory. A set P is a power dominating set (PDS) of a graph G = (V, E), if every vertex and every edge in the system is observed following the observation rules of power system monitoring. The minimum cardinality of a PDS of a graph G is the power domination number γp(G). In this paper, we determine the upper bounds of power domination number of generalized undirected de Bruijn graphs and generalized undirected Kau

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Generalized domination"

1

Li, Yuan-shin, and 李元馨. "Domination in generalized Petersen graphs." Thesis, 2011. http://ndltd.ncl.edu.tw/handle/25053155376826226509.

Full text

Abstract:

碩士<br>國立中央大學<br>數學研究所<br>99<br>A vertex subset S of a graph G is a dominating set if each vertex in V(G)−S is adjacent to at least one vertex in S. The domination number of G is the cardinality of a minimum dominating set of G, denoted by γ(G). A dominating set S is called an independent dominating set if S is also an independent set. The independent domination number of G is the cardinality of a minimum independent dominating set of G, denoted by γi(G). A dominating set S is called a total dominating set if each vertex v of G is dominated by some vertex u , v of S. The total domination number

APA, Harvard, Vancouver, ISO, and other styles

2

Cheng, Yi-Jie, and 鄭伊婕. "alpha-Domination of Generalized Petersen Graph." Thesis, 2014. http://ndltd.ncl.edu.tw/handle/27779682628490463135.

Full text

Abstract:

碩士<br>國立交通大學<br>應用數學系所<br>102<br>Let G = (V,E) be a graph with n vertices, m edges and no isolated vertices. For some α with 0 < α ≤ 1 and a set S ⊆ V, we say that S is α−dominating if for all v ∈ V − S, |N(v)∩ S| ≥ α|N(v)|. The size of a smallest such S is called the α−domination number of G denoted by γα(G). For positive integers n and k, the generalized Petersen graph P(n, k) is the graph with vertex set V = {u0, u1, . . ., un−1}∪{v0, v1, . . ., vn−1} and the edge set E = {uiui+1, uivi, vivi+k | i ∈ Zn} where addition is modulo n. Clearly, P(n, k) is a 3-regular graph. In this thesis, w

APA, Harvard, Vancouver, ISO, and other styles

3

Benecke, Stephen. "Domination of a generalized Cartesian product." Thesis, 2009. http://hdl.handle.net/1828/1493.

Full text

Abstract:

Let $G\ensuremath{\mathbin{\raisebox{0.3mm}{$\scriptstyle\square$}}} H$ denote the Cartesian product of the graphs $G$ and $H$. Domination of the Cartesian product of two graphs has received much attention, with a main objective to confirm the truth of Vizing's well-known conjecture. The conjecture states that the domination number of the Cartesian product of two graphs is at least as large as the product of the respective domination numbers. The potential truth of Vizing's conjecture gives rise to investigating the domination of graph products that generalizes the Cartesian product. The g

APA, Harvard, Vancouver, ISO, and other styles

4

Ko, Meng-Hao, and 柯孟豪. "Rainbow Domination in Generalized de Bruijn Digraphs." Thesis, 2014. http://ndltd.ncl.edu.tw/handle/10251529755844527977.

Full text

Abstract:

碩士<br>國立臺灣科技大學<br>資訊管理系<br>102<br>In this thesis, we are concerned with the k-rainbow domination problem on generalized de Bruijn digraphs. We give an upper bound and a lower bound for the k-rainbow domination number in generalized de Bruijn digraphs GB(n; d). We show that \gamma rk(GB(n, d)) = k if and only if \alpha ≤ 1, where n = d + \alpha and rk(GB(n, d)) is the k-rainbow domination number of GB(n, d). We also discuss the class of generalized de Bruijn digraphs with \gamma rk(GB(n, d)) ≤ k⌈ n/(d+1)⌉.

APA, Harvard, Vancouver, ISO, and other styles

5

Suchý, Ondřej. "Parametrizovaná složitost." Doctoral thesis, 2011. http://www.nusl.cz/ntk/nusl-300399.

Full text

Abstract:

Title: Parameterized Complexity Author: Ondřej Suchý Department: Department of Applied Mathematics Advisor: Prof. RNDr. Jan Kratochvíl, CSc. Advisor's e-mail address: honza@kam.mff.cuni.cz Abstract: This thesis deals with the parameterized complexity of NP-hard graph problems. We explore the complexity of the problems in various scenarios, with respect to miscellaneous parameters and their combina- tions. Our aim is rather to classify in this multivariate manner whether the particular parameters make the problem fixed-parameter tractable or intractable than to present the algorithm achieving t

APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Generalized domination"

1

Ron, James, Shannon Golden, David Crow, and Archana Pandya. Taking Root. Oxford University Press, 2017. http://dx.doi.org/10.1093/acprof:oso/9780199975044.001.0001.

Full text

Abstract:

The number of rights organizations worldwide has grown exponentially, as the term “human rights” becomes increasingly common among politicians and civil society activists. As international donors pour money into global human rights promotion, many governments—as well as scores of scholars and activists—fear a subtle, Western-led campaign for political, economic, and cultural domination. This book asks: What do publics in the global South think? Drawing on surveys in India, Mexico, Morocco, and Nigeria, the book finds most people are in fact broadly supportive of human rights discourse, trust l

APA, Harvard, Vancouver, ISO, and other styles

2

McGowan, Mary Kate. Just Words. Oxford University Press, 2019. http://dx.doi.org/10.1093/oso/9780198829706.001.0001.

Full text

Abstract:

We all know that speech is harmful but we need to be as clear as possible about what the harms are and how the speech in question brings about those harms. Clarity on these two points is important for jurisprudential reasons. It is also important for social, political, and moral reasons. Just Words identifies a previously overlooked mechanism by which speech constitutes, rather than merely causes, harm. Speech constitutes harm when it enacts a norm that prescribes that harm (so that following the norm brings about the harm). Just Words argues that there is a ubiquitous but hidden way that spee

APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Generalized domination"

1

Raman, Venkatesh, Saket Saurabh, and Sriganesh Srihari. "Parameterized Algorithms for Generalized Domination." In Combinatorial Optimization and Applications. Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-85097-7_11.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Golovach, Petr A., Jan Kratochvíl, and Ondřej Suchý. "Parameterized Complexity of Generalized Domination Problems." In Graph-Theoretic Concepts in Computer Science. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-11409-0_12.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Fomin, Fedor V., Petr A. Golovach, Jan Kratochvíl, Dieter Kratsch, and Mathieu Liedloff. "Branch and Recharge: Exact Algorithms for Generalized Domination." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2007. http://dx.doi.org/10.1007/978-3-540-73951-7_44.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Kikuchi, Yosuke, and Yukio Shibata. "On the Domination Numbers of Generalized de Bruijn Digraphs and Generalized Kautz Digraphs." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-44679-6_45.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Neto, José. "A Polyhedral View to Generalized Multiple Domination and Limited Packing." In Lecture Notes in Computer Science. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-96151-4_30.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Banu Priya, S., and A. Parthiban. "Equitable Power Domination Number of Generalized Petersen Graph, Balanced Binary Tree, and Subdivision of Certain Graphs." In Springer Proceedings in Mathematics & Statistics. Springer Singapore, 2021. http://dx.doi.org/10.1007/978-981-33-4646-8_16.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Jeyaseeli, J. Maria, Nazanin Movarraei, and S. Arumugam. "Dominator Coloring of Generalized Petersen Graphs." In Theoretical Computer Science and Discrete Mathematics. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-64419-6_19.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Nakkala, Mallikarjun Rao, and Alok Singh. "Heuristics for Generalized Minimum Dominating Set Problem." In Advances in Intelligent Systems and Computing. Springer Singapore, 2021. http://dx.doi.org/10.1007/978-981-16-1696-9_29.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Berger, André, and Ojas Parekh. "Linear Time Algorithms for Generalized Edge Dominating Set Problems." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11534273_21.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Habibulla, Yusupjan, Jin-Hua Zhao, and Hai-Jun Zhou. "The Directed Dominating Set Problem: Generalized Leaf Removal and Belief Propagation." In Frontiers in Algorithmics. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-19647-3_8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Generalized domination"

1

Angel, D., I. Annammal Arputhamary, and K. Ezhilarasi. "Location Domination for Generalized Friendship Graphs Analytics." In 2021 5th International Conference on Computing Methodologies and Communication (ICCMC). IEEE, 2021. http://dx.doi.org/10.1109/iccmc51019.2021.9418258.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Andrieu, V., L. Praly, and A. Astolfi. "Nonlinear output feedback design via domination and generalized weighted homogeneity." In Proceedings of the 45th IEEE Conference on Decision and Control. IEEE, 2006. http://dx.doi.org/10.1109/cdc.2006.377553.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Lu Li, Xingyu Wang, Xingsheng Gu, and Xiang Xiao. "Generalized dominating set and its evolutionary algorithm." In 2011 International Conference on Computer Science and Service System (CSSS). IEEE, 2011. http://dx.doi.org/10.1109/csss.2011.5974413.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Polat, Bahadir K., Pushkar Sachdeva, Mostafa H. Ammar, and Ellen W. Zegura. "Message ferries as generalized dominating sets in intermittently connected mobile networks." In the Second International Workshop. ACM Press, 2010. http://dx.doi.org/10.1145/1755743.1755749.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Zhou, Le, Tiankui Zhang, Xiaogeng Xu, Zhimin Zeng, and Yinlong Liu. "Generalized dominating set based cooperative caching for content centric ad hoc networks." In 2015 IEEE/CIC International Conference on Communications in China (ICCC). IEEE, 2015. http://dx.doi.org/10.1109/iccchina.2015.7448632.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Canfield, Stephen L., Daniel L. Chlarson, Alexander Shibakov, and Patrick V. Hull. "Towards Uniformly Distributed Compliance in Compliant Mechanisms: A Multi-Objective Approach." In ASME 2006 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2006. http://dx.doi.org/10.1115/detc2006-99601.

Full text

Abstract:

Researchers in the field of optimal synthesis of compliant mechanisms have been working to develop tools that yield distributed compliant devices to perform specific tasks. However, it has been demonstrated in the literature that much of this work has resulted in mechanisms that localize compliance rather than distribute it as desired. In fact, Yin and Ananthasuresh (2003) [1] demonstrate that based on the current formulation of optimality criteria and analysis via the finite element (FE) technique, a lumped compliant device will always exist as the minimizing solution to the objective functio

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!