Relevant bibliographies by topics / Domination number

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Domination number'

Author: Grafiati
Published: 4 June 2021
Last updated: 26 July 2025

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 'Domination number.'

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 "Domination number"

1

Esakkimuthu, A., and S. Mari Selvam. "Equitable Color Class Domination Number of Honeycomb Networks Graph and Inverse Equitable Color Class Domination Number of a Graph." Indian Journal Of Science And Technology 17, no. 36 (2024): 3800–3810. http://dx.doi.org/10.17485/ijst/v17i36.2458.

Full text
Abstract:
Objectives: In this study, we find a new graph domination parameter named “Inverse Equitable Color Class Domination” and discuss the equitable color class domination number of honeycomb networks graph. Methods: Let be a connected graph. Assume a group containing colors. Let be an equitably colorable function. A dominating subset of is called an equitable color class dominating set if the number of dominating nodes in each color class is equal. The least possible cardinality of an equitable color class dominating set of is the equitable color class domination number itself. It is indicated by .
APA, Harvard, Vancouver, ISO, and other styles
2

Shanthi, P., S. Amutha, N. Anbazhagan, and G. Uma. "Fractional Star Domination Number of Graphs." Indian Journal Of Science And Technology 17, SPI1 (2024): 64–70. http://dx.doi.org/10.17485/ijst/v17sp1.111.

Full text
Abstract:
Objectives: Consider a graph is the connected, undirected graph. This study creates a new parameter named the Fractional Star Domination Number (FRSDN), which is denoted by to calculate the minimum weight with the star of all vertices of and the function values of all edges. Methods: This study evaluates the of some standard graphs and bounds by generalizing the value that is provided by the function value of an edges. Findings: This study evaluated on some standard graphs, such as paths, cycles, and the rooted product of paths and cycles. Finally, we obtain some bounds on for some general gra
APA, Harvard, Vancouver, ISO, and other styles
3

Ilakkiya, D., and V. Mohana Selvi. "Odd and Co – Odd Sum Degree Domination in Graphs with Algorithm." Indian Journal Of Science And Technology 17, no. 32 (2024): 3368–76. http://dx.doi.org/10.17485/ijst/v17i32.1295.

Full text
Abstract:
Objectives: The main aim of this study is to introduce two new domination parameters, namely odd and co-odd sum degree domination numbers, and to provide an algorithm for finding the odd sum degree dominating set of a graph. Methods: The odd and co-odd sum degree domination numbers of a graph G are introduced by verifying the following two conditions on dominating and co-dominating sets of G. (i) The sum of degree of vertices of the dominating and co-dominating sets are odd numbers. (ii) The cardinality of the above two sets are minimum. Further, obtained the degree sum values of the above two
APA, Harvard, Vancouver, ISO, and other styles
4

Mahadevan, G., P. Niveditha, and C. Sivagnanam. "Outer Triple Connected Corona Domination Number of Graphs." Indian Journal Of Science And Technology 17, SPI1 (2024): 136–43. http://dx.doi.org/10.17485/ijst/v17sp1.250.

Full text
Abstract:
Background/ Objective: Given a graph G, a dominating set is said to be corona dominating set if every vertex such that or there exist a vertex if then . A corona dominating set is said to be an outer triple connected corona dominating set if any three vertices in lie on a path. The minimum cardinality taken over all the outer triple connected corona dominating sets of is called outer triple connected corona dominating number and it is denoted by . The study aims to find the outer triple connected corona domination number of some graphs. Method: To obtain outer triple connected corona dominatio
APA, Harvard, Vancouver, ISO, and other styles
5

Uma, G., S. Amutha, N. Anbazhagan, and P. Shanthi. "Fractional Domination Number of the Fractal Graphs." Indian Journal Of Science And Technology 17, SPI1 (2024): 34–39. http://dx.doi.org/10.17485/ijst/v17sp1.110.

Full text
Abstract:
Background/Objectives: A fractal is a collection of clearly defined structures that are uneven or irregular and can be divided into smaller pieces. Each of these smaller pieces has a relationship to the overall structure at random ranges that are analogous or identical. Fractal graphs are a highly effective way to construct well-defined patterns. The fractional domination number in a graph refers to the weight of a minimum fractional dominating function. The study is to find the bounds of the fractional domination and their related parameters in the fractal graphs. Methods: The sharp bounds an
APA, Harvard, Vancouver, ISO, and other styles
6

Revathi, R., and P. Vidhya. "Tree Domination Number of Semi Total Point Graphs." Indian Journal Of Science And Technology 17, no. 30 (2024): 3109–15. http://dx.doi.org/10.17485/ijst/v17i30.1612.

Full text
Abstract:
Objectives: The main aim of the research work is to study the concept of a tree domination number of semi-total point graphs. Method: A set D of a graph G = (V, E) is a dominating set, if every vertex in V- D is adjacent to at least one vertex in D. The domination number is the minimum cardinality of a dominating set D. A dominating set D is called a tree dominating set, if the induced subgraph is a tree. The minimum cardinality of a tree dominating set is called the tree-domination number of G and is denoted by . For any graph G = (V, E), the semi-total point graph T2(G) = H is the graph whos
APA, Harvard, Vancouver, ISO, and other styles
7

D, Ilakkiya, and Mohana Selvi V. "Odd and Co – Odd Sum Degree Domination in Graphs with Algorithm." Indian Journal of Science and Technology 17, no. 32 (2024): 3368–76. https://doi.org/10.17485/IJST/v17i32.1295.

Full text
Abstract:
Abstract <strong>Objectives:</strong>&nbsp;The main aim of this study is to introduce two new domination parameters, namely odd and co-odd sum degree domination numbers, and to provide an algorithm for finding the odd sum degree dominating set of a graph.&nbsp;<strong>Methods:</strong>&nbsp;The odd and co-odd sum degree domination numbers of a graph G are introduced by verifying the following two conditions on dominating and co-dominating sets of G. (i) The sum of degree of vertices of the dominating and co-dominating sets are odd numbers. (ii) The cardinality of the above two sets are minimum
APA, Harvard, Vancouver, ISO, and other styles
8

Basavanagoud, B., and S. M. Hosamani. "Complete Cototal Domination Number of a Graph." Journal of Scientific Research 3, no. 3 (2011): 547–55. http://dx.doi.org/10.3329/jsr.v3i3.7744.

Full text
Abstract:
Let be a graph. A set of a graph is called a total dominating set if the induced subgraph has no isolated vertices. The total domination number of G is the minimum cardinality of a total dominating set of G. A total dominating set D is said to be a complete cototal dominating set if the induced subgraph has no isolated vertices. The complete cototal domination number of G is the minimum cardinality of a complete cototal dominating set of G. In this paper, we initiate the study of complete cototal domination in graphs and present bounds and some exact values for . Also its relationship with oth
APA, Harvard, Vancouver, ISO, and other styles
9

Kaviya, S., G. Mahadevan, and C. Sivagnanam. "Generalizing TCCD-Number For Power Graph Of Some Graphs." Indian Journal Of Science And Technology 17, SPI1 (2024): 115–23. http://dx.doi.org/10.17485/ijst/v17sp1.243.

Full text
Abstract:
Objective: Finding the triple connected certified domination number for the power graph of some peculiar graphs. Methods: A dominating set with the condition that every vertex in has either zero or at least two neighbors in and is triple connected is a called triple connected certified domination number of a graph. The minimum cardinality among all the triple connected certified dominating sets is called the triple connected certified domination number and is denoted by . The upper bound and lower bound of for the given graphs is found and then proved the upper bound and lower bound of were eq
APA, Harvard, Vancouver, ISO, and other styles
10

Praveenkumar, L., G. Mahadevan, and C. Sivagnanam. "Generalization of CD-Number for Power Graph of Some Special Types of Tree Graphs." Indian Journal Of Science And Technology 17, SPI1 (2024): 109–14. http://dx.doi.org/10.17485/ijst/v17sp1.223.

Full text
Abstract:
Objectives: The main objective of the article is to finding the corona domination for the power graph of some special types of tree graph. Method: A dominating set of a graph is said to be a corona dominating set if every vertex in is either a pendant vertex or a support vertex. The minimum cardinality of a corona dominating set is called the corona domination number and is denoted by . Findings: In this article, we study the -number for the power of PVB-tree and where and identify their exact values. Novelty: The corona domination was one of the recently developed domination parameter, along
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Domination number"

1

Hopkins, Lora Shuler. "Bounds on total domination subdivision numbers." [Johnson City, Tenn. : East Tennessee State University], 2003. http://etd-submit.etsu.edu/etd/theses/available/etd-0223103-205608/unrestricted/HopkinsL031403f.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Bukhary, Nisreen. "Domination in Benzenoids." VCU Scholars Compass, 2010. http://scholarscompass.vcu.edu/etd/2118.

Full text
Abstract:
A benzenoid is a molecule that can be represented as a graph. This graph is a fragment of the hexagon lattice. A dominating set $D$ in a graph $G$ is a set of vertices such that each vertex of the graph is either in $D$ or adjacent to a vertex in $D$. The domination number $\gamma=\gamma(G)$ of a graph $G$ is the size of a minimum dominating set. We will find formulas and bounds for the domination number of various special benzenoids, namely, linear chains $L(h)$, triangulenes $T_k$, and parallelogram benzenoids $B_{p,q}$. The domination ratio of a graph $G$ is $\frac{\gamma(G)}{n(G)}$, wher
APA, Harvard, Vancouver, ISO, and other styles
3

Chukwukere, Presley. "The 2-Domination Number of a Caterpillar." Digital Commons @ East Tennessee State University, 2018. https://dc.etsu.edu/etd/3456.

Full text
Abstract:
A set D of vertices in a graph G is a 2-dominating set of G if every vertex in V − D has at least two neighbors in D. The 2-domination number of a graph G, denoted by γ2(G), is the minimum cardinality of a 2- dominating set of G. In this thesis, we discuss the 2-domination number of a special family of trees, called caterpillars. A caterpillar is a graph denoted by Pk(x1, x2, ..., xk), where xi is the number of leaves attached to the ith vertex of the path Pk. First, we present the 2-domination number of some classes of caterpillars. Second, we consider several types of complete caterpillars.
APA, Harvard, Vancouver, ISO, and other styles
4

Alhashim, Alawi I. "Roman Domination in Complementary Prisms." Digital Commons @ East Tennessee State University, 2017. https://dc.etsu.edu/etd/3175.

Full text
Abstract:
The complementary prism GG of a graph G is formed from the disjoint union of G and its complement G by adding the edges of a perfect match- ing between the corresponding vertices of G and G. A Roman dominating function on a graph G = (V,E) is a labeling f : V(G) → {0,1,2} such that every vertex with label 0 is adjacent to a vertex with label 2. The Roman domination number γR(G) of G is the minimum f(V ) = Σv∈V f(v) over all such functions of G. We study the Roman domination number of complementary prisms. Our main results show that γR(GG) takes on a limited number of values in terms of the dom
APA, Harvard, Vancouver, ISO, and other styles
5

Roux, Adriana. "On the (r,s)-domination number of a graph." Thesis, Stellenbosch : Stellenbosch University, 2014. http://hdl.handle.net/10019.1/86266.

Full text
Abstract:
Thesis (PhD)--Stellenbosch University, 2014.<br>ENGLISH ABSTRACT: The (classical) domination number of a graph is the cardinality of a smallest subset of its vertex set with the property that each vertex of the graph is in the subset or adjacent to a vertex in the subset. Since its introduction to the literature during the early 1960s, this graph parameter has been researched extensively and nds application in the generic facility location problem where a smallest number of facilities must be located on the vertices of the graph, at most one facility per vertex, so that there is at least
APA, Harvard, Vancouver, ISO, and other styles
6

Jamieson, William. "General Bounds on the Downhill Domination Number in Graphs." Digital Commons @ East Tennessee State University, 2013. https://dc.etsu.edu/honors/107.

Full text
Abstract:
A path π = (v1, v2,...vk+1) in a graph G = (V,E) is a downhill path if for every i, 1 < i < k, deg(vi) > deg(vi+1), where deg(vi) denotes the degree of vertex vi ∊ V. The downhill domination number equals the minimum cardinality of a set S ⊂ V having the property that every vertex v ∊ V lies on a downhill path originating from some vertex in S. We investigate downhill domination numbers of graphs and give upper bounds. In particular, we show that the downhill domination number of a graph is at most half its order, and that the downhill domination number of a tree is at most one third its order
APA, Harvard, Vancouver, ISO, and other styles
7

McCoy, Tabitha Lynn. "Cost Effective Domination in Graphs." Digital Commons @ East Tennessee State University, 2012. https://dc.etsu.edu/etd/1485.

Full text
Abstract:
A set S of vertices in a graph G = (V,E) is a dominating set if every vertex in V \ S is adjacent to at least one vertex in S. A vertex v in a dominating set S is said to be it cost effective if it is adjacent to at least as many vertices in V \ S as it is in S. A dominating set S is cost effective if every vertex in S is cost effective. The minimum cardinality of a cost effective dominating set of G is the cost effective domination number of G. In addition to some preliminary results for general graphs, we give lower and upper bounds on the cost effective domination number of trees in terms o
APA, Harvard, Vancouver, ISO, and other styles
8

Rodriguez, Tony K. "Very Cost Effective Domination in Graphs." Digital Commons @ East Tennessee State University, 2014. https://dc.etsu.edu/etd/2345.

Full text
Abstract:
A set S of vertices in a graph G=(V,E) is a dominating set if every vertex in V\S is adjacent to at least one vertex in S, and the minimum cardinality of a dominating set of G is the domination number of G. A vertex v in a dominating set S is said to be very cost effective if it is adjacent to more vertices in V\S than to vertices in S. A dominating set S is very cost effective if every vertex in S is very cost effective. The minimum cardinality of a very cost effective dominating set of G is the very cost effective domination number of G. We first give necessary conditions for a graph to have
APA, Harvard, Vancouver, ISO, and other styles
9

Cheney, Stephen R. "Domination Numbers of Semi-strong Products of Graphs." VCU Scholars Compass, 2015. http://scholarscompass.vcu.edu/etd/3989.

Full text
Abstract:
This thesis examines the domination number of the semi-strong product of two graphs G and H where both G and H are simple and connected graphs. The product has an edge set that is the union of the edge set of the direct product of G and H together with the cardinality of V(H), copies of G. Unlike the other more common products (Cartesian, direct and strong), the semi-strong product is neither commutative nor associative. The semi-strong product is not supermultiplicative, so it does not satisfy a Vizing like conjecture. It is also not submultiplicative so it shares these two properties with th
APA, Harvard, Vancouver, ISO, and other styles
10

Kiser, Derek. "Distance-2 Domatic Numbers of Graphs." Digital Commons @ East Tennessee State University, 2015. https://dc.etsu.edu/etd/2505.

Full text
Abstract:
The distance d(u, v) between two vertices u and v in a graph G equals the length of a shortest path from u to v. A set S of vertices is called a distance-2 dominating set if every vertex in V \S is within distance-2 of at least one vertex in S. The distance-2 domatic number is the maximum number of sets in a partition of the vertices of G into distance-2 dominating sets. We give bounds on the distance-2 domatic number of a graph and determine the distance-2 domatic number of selected classes of graphs.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Domination number"

1

Kang, Mathilde. Francophonie en Orient. Amsterdam University Press, 2017. http://dx.doi.org/10.5117/9789462985148.

Full text
Abstract:
This book offers a pioneering study of Asian cultures that officially escaped from French colonisation but nonetheless were steeped in French civilisation in the colonial era and had heavily French-influenced, largely francophone literatures. It raises a number of provocative questions, including whether colonisation is the ultimate requirement for a culture's being defined as francophone, or how to think about francophone literatures that emerge from Asian nations that were historically free from French domination. The ultimate result is a redefining of the Asian francophone heritage accordin
APA, Harvard, Vancouver, ISO, and other styles
2

Karabuschenko, Pavel, and Arushan Vartumyan. Anglo-Saxons: falsification of political history (experience of historical hermeneutics). INFRA-M Academic Publishing LLC., 2023. http://dx.doi.org/10.12737/1877339.

Full text
Abstract:
The monograph is the result of a long-term study of the problem of falsification of Anglo-Saxon history, which was conducted by its political elites as part of their professional activities. Falsification plays the role of an informational "UFO" in the field of historical knowledge — many people talk about it, while little understanding the real nature of its essence. There are fakes in all national histories, and the largest number of them are found in those countries whose elites claim world domination, since it is simply impossible to exercise such domination without lies.&#x0D; Falsificati
APA, Harvard, Vancouver, ISO, and other styles
3

Lovett, Frank. Non-Domination. Edited by David Schmidtz and Carmen E. Pavel. Oxford University Press, 2016. http://dx.doi.org/10.1093/oxfordhb/9780199989423.013.3.

Full text
Abstract:
How should freedom be characterized as a political ideal? This chapter explores one such view, commonly called “republican” or sometimes “neo-Roman,” which holds that the specific sort of freedom a well-ordered society ought to promote is freedom from domination. Recently, a number of new challenges to this view have been raised. The most important of these are that republicans have failed to develop a conception of freedom distinct in any meaningful sense from the non-interference conception and, in concentrating on relationships of domination, inappropriately narrowed the scope of freedom. T
APA, Harvard, Vancouver, ISO, and other styles
4

Terminator Salvation Color by Number: John Connor Resistance of Humans Against Robots Domination Film Illustration Color Number Book for Fans Adults Creativity Gift. Independently Published, 2020.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Öktem, Öz. Images of the Muslim Woman in Early Modern English Drama. The Rowman & Littlefield Publishing Group, 2021. https://doi.org/10.5040/9781666995411.

Full text
Abstract:
Early modern scholarship often reads the dramatic representations of the Muslim woman in the light of postcolonial identity politics, which sees an organic relationship between the West’s historical domination of the East and the Western discourse on the East. This book problematizes the above trajectory by arguing that the assumption of a power relation between a dominating West and a subordinate East cannot be sustained within the context of the political and historical realities of early modern Europe. The Ottoman Empire remained as a dominant superpower throughout the sixteenth and sevente
APA, Harvard, Vancouver, ISO, and other styles
6

Sudhakaraiah, Dr Anupalli, and Dr Tata Sivaiah. Study of All Powers of Paths and Cycles Towards Domination: Study of All Powers of Paths and Cycles Towards Domination and Labeling Numbers. GlobeEdit, 2022.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Dallmayr, Fred. Conclusion. Oxford University Press, 2017. http://dx.doi.org/10.1093/acprof:oso/9780190670979.003.0009.

Full text
Abstract:
These remarks reiterate the view articulated in the book that the rise of modern democracy signifies more than just the expansion of the number of rulers, but rather a basic “paradigm shift” involving multiple dimensions of life and thought (comprising political, metaphysical, and even theological dimensions). By comparison, the remarks stress a more holistic breakthrough: the emergence of a new spirituality coupled with the deepening of a lateral or horizontal humanism under the aegis of a relational democracy. The constitutive elements of democracy—whose relationship has to be continuously r
APA, Harvard, Vancouver, ISO, and other styles
8

Taine-Cheikh, Catherine. Historical and typological approaches to Mauritanian and West Saharan Arabic. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780198701378.003.0010.

Full text
Abstract:
Mauritania, a Muslim country the majority of whose population speaks Ḥassāniyya Arabic, is at the western edge of the Arabic-speaking world. At the birth of Islam, the western part of the Sahara was inhabited by Berbers, with Black African populations bordering their territories to the south and south-east. After the arrival of the Banī Maˤqil at the end of the thirteenth century, Arabic- and Berber-speaking groups coexisted more or less peacefully, the Arabic speakers achieving supremacy little by little, starting in the military and political sphere and ending with cultural and linguistic do
APA, Harvard, Vancouver, ISO, and other styles
9

Anker, Elisabeth R. Ugly Freedoms. Duke University Press, 2022. http://dx.doi.org/10.1215/9781478022404.

Full text
Abstract:
In Ugly Freedoms Elisabeth R. Anker reckons with the complex legacy of freedom offered by liberal American democracy, outlining how the emphasis of individual liberty has always been entangled with white supremacy, settler colonialism, climate destruction, economic exploitation, and patriarchy. These “ugly freedoms” legitimate the right to exploit and subjugate others. At the same time, Anker locates an unexpected second type of ugly freedom in practices and situations often dismissed as demeaning, offensive, gross, and ineffectual but that provide sources of emancipatory potential. She analyz
APA, Harvard, Vancouver, ISO, and other styles
10

Lobell, Steven E. Structural Realism/Offensive and Defensive Realism. Oxford University Press, 2017. http://dx.doi.org/10.1093/acrefore/9780190846626.013.304.

Full text
Abstract:
Structural realism, or neorealism, is a theory of international relations that says power is the most important factor in international relations. First outlined by Kenneth Waltz in his 1979 book Theory of International Politics, structural realism is subdivided into two factions: offensive realism and defensive realism. Structural realism holds that the nature of the international structure is defined by its ordering principle, anarchy, and by the distribution of capabilities (measured by the number of great powers within the international system). The anarchic ordering principle of the inter
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Domination number"

1

Henning, Michael A., and Anders Yeo. "Total Domination Number Versus Matching Number." In Springer Monographs in Mathematics. Springer New York, 2013. http://dx.doi.org/10.1007/978-1-4614-6525-6_10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Poovathingal, Agnes, and Joseph Varghese Kureethara. "On Some Graphs Whose Domination Number Is the Perfect Italian Domination Number." In Lecture Notes in Networks and Systems. Springer Nature Singapore, 2024. http://dx.doi.org/10.1007/978-981-99-9040-5_13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Fomin, Fedor, Dieter Kratsch, and Haiko Müller. "On the Domination Search Number." In Graph-Theoretic Concepts in Computer Science. Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/3-540-40064-8_16.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Mahadevan, G., M. Vimala Suganthi, and C. Sivagnanam. "Corona Domination Number of Graphs." In Springer Proceedings in Mathematics & Statistics. Springer Singapore, 2021. http://dx.doi.org/10.1007/978-981-16-6018-4_16.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Anitha, J., Indra Rajasingh, and Jane Olive Sharon. "Domination Number in Sierpiński Networks." In Springer Proceedings in Mathematics & Statistics. Springer Nature Switzerland, 2012. https://doi.org/10.1007/978-3-031-77764-6_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Aggarwal, Divesh, Shashank K. Mehta, and Jitender S. Deogun. "Domination Search on Graphs with Low Dominating-Target-Number." In Graph-Theoretic Concepts in Computer Science. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11604686_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Pai, Kung-Jui, and Wei-Jai Chiu. "3-Rainbow Domination Number in Graphs." In Proceedings of the Institute of Industrial Engineers Asian Conference 2013. Springer Singapore, 2013. http://dx.doi.org/10.1007/978-981-4451-98-7_86.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Srinivasan, Adarsh, and N. S. Narayanaswamy. "The Connected Domination Number of Grids." In Algorithms and Discrete Applied Mathematics. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-67899-9_19.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Henning, Michael A., and Anders Yeo. "Relating the Size and Total Domination Number." In Springer Monographs in Mathematics. Springer New York, 2013. http://dx.doi.org/10.1007/978-1-4614-6525-6_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Muthuselvi, A., and S. Arumugam. "Upper Majority Domination Number of a Graph." In Theoretical Computer Science and Discrete Mathematics. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-64419-6_26.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Domination number"

1

Wang, Yuting, Shuyan Du, Siyu Wang, and Hong Gao. "Triple Roman Domination Number of Circulant Graph." In 2025 7th International Conference on Information Science, Electrical and Automation Engineering (ISEAE). IEEE, 2025. https://doi.org/10.1109/iseae64934.2025.11041871.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Meena, J., and T. N. M. Malini Mai. "Exploring Variant Roman Domination Number in Complete Binary Trees Using Python Programming." In 2024 International Conference on Sustainable Communication Networks and Application (ICSCNA). IEEE, 2024. https://doi.org/10.1109/icscna63714.2024.10863879.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Saifudin, Ilham, Triyanna Widiyaningtyas, Ilham Ari Elbaith Zaeni, Agung Nilogiri, Hairani Hairani, and Abu Tholib. "Two Distance Domination Numbers of Graphs Resulting from Amalgamation Operation of Combination of Path Graphs and Special Graphs." In 2024 Beyond Technology Summit on Informatics International Conference (BTS-I2C). IEEE, 2024. https://doi.org/10.1109/bts-i2c63534.2024.10942127.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Schmitz, Sven, Nicholas Jaffa, David Reich, et al. "Flow Diagnostics of Scaled-Model Coaxial Rotor Hub Flows." In Vertical Flight Society 80th Annual Forum & Technology Display. The Vertical Flight Society, 2024. http://dx.doi.org/10.4050/f-0080-2024-1130.

Full text
Abstract:
Rotor hub parasite drag remains one of the challenges in further improving the forward-flight capabilities of coaxial rotorcraft. Comprehensive datasets on notional coaxial hub configurations are rare, and more so at Reynolds numbers sufficiently high to preserve dominating flow structures downstream into the wake where they interact with the rotorcraft empennage and tail. The present investigation was designed specifically to improve the understanding of interactional aerodynamics effects and wake flow physics of counter-rotating coaxial rotor hubs. A unique dataset is presented on a rotor hu
APA, Harvard, Vancouver, ISO, and other styles
5

Bhagwat, Kamaljit Kaur, and Vishwajeet S. Goswami. "Graphs with same domination and connected domination number: A review." In 2ND INTERNATIONAL CONFERENCE ON RECENT ADVANCES IN COMPUTATIONAL TECHNIQUES. AIP Publishing, 2023. http://dx.doi.org/10.1063/5.0141051.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Omran, Ahmed A., and Haneen Aljanaby. "Inverse Hn-domination number in graphs." In PROCEEDING OF THE 1ST INTERNATIONAL CONFERENCE ON ADVANCED RESEARCH IN PURE AND APPLIED SCIENCE (ICARPAS2021): Third Annual Conference of Al-Muthanna University/College of Science. AIP Publishing, 2022. http://dx.doi.org/10.1063/5.0093690.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Goswami, Vishwajeet S., Azham ILyass, and Kamaljit Kaur Bhagwat. "Certified domination number of some graphs." In 2ND INTERNATIONAL CONFERENCE ON RECENT ADVANCES IN COMPUTATIONAL TECHNIQUES. AIP Publishing, 2023. http://dx.doi.org/10.1063/5.0140648.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Yogalakshmi, S., G. C. Basavaraju, S. Lakshminarayana, and M. Vishukumar. "Metro domination number of some graphs." In 2ND INTERNATIONAL CONFERENCE ON RECENT TRENDS IN APPLIED AND COMPUTATIONAL MATHEMATICS: ICRTACM-2021. AIP Publishing, 2023. http://dx.doi.org/10.1063/5.0114645.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Gao, Hong, Wei Duan, Tingting Feng, and Yuansheng Yang. "Signed Mixed Domination Number of Circulant Graphs." In 2019 International Conference on Electronic Engineering and Informatics (EEI). IEEE, 2019. http://dx.doi.org/10.1109/eei48997.2019.00113.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Gudgeri, Manjula C., Pallavi Sangolli, and J. Varsha. "Roman domination number of path related graphs." In THIRD VIRTUAL INTERNATIONAL CONFERENCE ON MATERIALS, MANUFACTURING AND NANOTECHNOLOGY. AIP Publishing, 2022. http://dx.doi.org/10.1063/5.0096475.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Domination number"

1

Macdonald, Kier. Financing for Micro, Small, and Medium-sized Enterprises in Kenya. Institute of Development Studies, 2025. https://doi.org/10.19088/k4dd.2025.006.

Full text
Abstract:
This rapid evidence review assesses the recent academic and grey literature on the topic of financing for micro, small and medium-sized enterprises (MSMEs) in Kenya . The literature reveals a dearth of highly-cited papers on the topic, and while there are a number of studies which are positive on the effectiveness of different types of financing on the performance of MSMEs, there is scope for further literature which engage with the potential risks or problems associated with different financing methods. The literature demonstrates that the landscape for MSME financing in Kenya is relatively f
APA, Harvard, Vancouver, ISO, and other styles
2

Svahn, Emma. Faktablad – Resultat från övervakningen av kustfisk – Kvädöfjärden (Egentliga Östersjön) 1989‒2022. Institutionen för akvatiska resurser, Sveriges lantbruksuniversitet, 2024. http://dx.doi.org/10.54612/a.4e98k7nsrq.

Full text
Abstract:
Coastal fish monitoring in the autumn has been conducted in Kvädöfjärden using the gear net series since 1989. The fishing methodology was revised in 2018 and resulted in only one night of fishing per station in contrast to six consecutive nights. Only the first night of fishing over all years has hence been included in the analysis in this report. A survey with Nordic coastal multimesh gillnets was performed for the first time in autumn the same year as the revision and has been executed annually since then. The methodologies are not fully comparable, and has thus been analysed separately in
APA, Harvard, Vancouver, ISO, and other styles
3

van Gemert, Rob, Per Holliland, Konrad Karlsson, Niklas Sjöberg, and Torbjörn Säterberg. Assessment of the eel stock in Sweden, spring 2024 : fifth post-evaluation of the Swedish eel management. Department of Aquatic Resources, Swedish University of Agricultural Sciences, 2024. http://dx.doi.org/10.54612/a.4iseib7eup.

Full text
Abstract:
For decades, the population of the European eel has been in severe decline. In 2007, the European Union decided on a Regulation establishing measures for the recovery of the stock, which obliged Member States to implement a national Eel Management Plan by 2009. Sweden submitted its plan in 2008. According to the Regulation, Member States shall report regularly to the EU-Commission, on the implementation of their Eel Management Plans and the progress achieved in protection and restoration. The current report provides an assessment of the eel stock in Sweden as of spring 2024, intending to feed
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Domination number' for particular source types:
Journal articles Dissertations / Theses Books
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!

To the bibliography