Relevant bibliographies by topics / Perfect domination

Contents

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

Academic literature on the topic 'Perfect domination'

Author: Grafiati
Published: 4 June 2021
Last updated: 1 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 'Perfect 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 "Perfect domination"

1

Rakim, Raicah Cayongcat, and Helen M. Rara. "Total Perfect Hop Domination in Graphs Under Some Binary Operations." European Journal of Pure and Applied Mathematics 14, no. 3 (2021): 803–15. http://dx.doi.org/10.29020/nybg.ejpam.v14i3.3975.

Full text
Abstract:
Let G = (V (G), E(G)) be a simple graph. A set S ⊆ V (G) is a perfect hop dominating set of G if for every v ∈ V (G) \ S, there is exactly one vertex u ∈ S such that dG(u, v) = 2. The smallest cardinality of a perfect hop dominating set of G is called the perfect hop domination number of G, denoted by γph(G). A perfect hop dominating set S ⊆ V (G) is called a total perfect hop dominating set of G if for every v ∈ V (G), there is exactly one vertex u ∈ S such that dG(u, v) = 2. The total perfect hop domination number of G, denoted by γtph(G), is the smallest cardinality of a total
APA, Harvard, Vancouver, ISO, and other styles
2

Shao, Zehui, Saeed Kosari, Mustapha Chellali, Seyed Mahmoud Sheikholeslami, and Marzieh Soroudi. "On a Relation between the Perfect Roman Domination and Perfect Domination Numbers of a Tree." Mathematics 8, no. 6 (2020): 966. http://dx.doi.org/10.3390/math8060966.

Full text
Abstract:
A dominating set in a graph G is a set of vertices S ⊆ V ( G ) such that any vertex of V − S is adjacent to at least one vertex of S . A dominating set S of G is said to be a perfect dominating set if each vertex in V − S is adjacent to exactly one vertex in S. The minimum cardinality of a perfect dominating set is the perfect domination number γ p ( G ) . A function f : V ( G ) → { 0 , 1 , 2 } is a perfect Roman dominating function (PRDF) on G if every vertex u ∈ V for which f ( u ) = 0 is adjacent to exactly one vertex v for which f ( v ) = 2 . The weight of a PRDF is the sum of its function
APA, Harvard, Vancouver, ISO, and other styles
3

Cáceres, José, Carmen Hernando, Mercè Mora, Ignacio Pelayo, and María Puertas. "Perfect and quasiperfect domination in trees." Applicable Analysis and Discrete Mathematics 10, no. 1 (2016): 46–64. http://dx.doi.org/10.2298/aadm160406007c.

Full text
Abstract:
A k??quasiperfect dominating set of a connected graph G is a vertex subset S such that every vertex not in S is adjacent to at least one and at most k vertices in S. The cardinality of a minimum k-quasiperfect dominating set in G is denoted by ?1k(G). These graph parameters were first introduced by Chellali et al. (2013) as a generalization of both the perfect domination number ?11(G) and the domination number ?(G). The study of the so-called quasiperfect domination chain ?11(G) ? ?12(G)?... ? ?1?(G) = ?(G) enable us to analyze how far minimum dominating sets are from being perfect. In this pa
APA, Harvard, Vancouver, ISO, and other styles
4

Paleta, Leonard Mijares, and Ferdinand Paler Jamil. "More on Perfect Roman Domination in Graphs." European Journal of Pure and Applied Mathematics 13, no. 3 (2020): 529–48. http://dx.doi.org/10.29020/nybg.ejpam.v13i3.3763.

Full text
Abstract:
A perfect Roman dominating function on a graph G = (V (G), E(G)) is a function f : V (G) → {0, 1, 2} for which each u ∈ V (G) with f(u) = 0 is adjacent to exactly one vertex v ∈ V (G) with f(v) = 2. The weight of a perfect Roman dominating function f is the value ωG(f) = Pv∈V (G) f(v). The perfect Roman domination number of G is the minimum weight of a perfect Roman dominating function on G. In this paper, we study the perfect Roman domination numbers of graphs under some binary operation
APA, Harvard, Vancouver, ISO, and other styles
5

P., Paul Hawkins, Anto A.M., and Shyla Isac Mary T. "Perfect dominating sets and perfect domination polynomial of a star graph." Malaya Journal of Matematik 8, no. 4 (2020): 1751–55. http://dx.doi.org/10.26637/mjm0804/0071.

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

M.P., Kulandai Vel, Selvaraju P., and Sivagnanam C. "Neighborhood connected perfect domination in graphs." Tamkang Journal of Mathematics 43, no. 4 (2012): 557–62. http://dx.doi.org/10.5556/j.tkjm.43.2012.839.

Full text
Abstract:
Let $G = (V, E)$ be a connected graph. A set $S$ of vertices in $G$ is a perfect dominating set if every vertex $v$ in $V-S$ is adjacent to exactly one vertex in $S$. A perfect dominating set $S$ is said to be a neighborhood connected perfect dominating set (ncpd-set) if the induced subgraph $$ is connected. The minimum cardinality of a ncpd-set of $G$ is called the neighborhood connected perfect domination number of $G$ and is denoted by $\gamma_{ncp}(G)$. In this paper we initiate a study of this parameter.
APA, Harvard, Vancouver, ISO, and other styles
7

Jeya Jothi, R. Mary, and A. Amutha. "Characterization of Super Strongly Perfect Graphs in Chordal and Strongly Chordal Graphs." Mapana - Journal of Sciences 11, no. 4 (2012): 121–31. http://dx.doi.org/10.12723/mjs.23.10.

Full text
Abstract:
A Graph G is Super Strongly Perfect Graph if every induced sub graph H of G possesses a minimal dominating set that meets all the maximal complete sub graphs of H. In this paper, we have investigated the characterization of Super Strongly Perfect graphs using odd cycles. We have given the characterization of Super Strongly Perfect graphs in chordal and strongly chordal graphs. We have presented the results of Chordal graphs in terms of domination and co - domination numbers γ and . We have given the relationship between diameter, domination and co - domination numbers of chordal graphs. Also w
APA, Harvard, Vancouver, ISO, and other styles
8

Henning, Michael, and William Klostermeyer. "Perfect roman domination in regular graphs." Applicable Analysis and Discrete Mathematics 12, no. 1 (2018): 143–52. http://dx.doi.org/10.2298/aadm1801143h.

Full text
Abstract:
A perfect Roman dominating function on a graph G is a function f : V (G) ? {0,1,2} satisfying the condition that every vertex u with f(u) = 0 is adjacent to exactly one vertex v for which f(v) = 2. The weight of a perfect Roman dominating function f is the sum of the weights of the vertices. The perfect Roman domination number of G, denoted ?pR(G), is the minimum weight of a perfect Roman dominating function in G. We show that if G is a cubic graph on n vertices, then ?pR(G) ? 3/4n, and this bound is best possible. Further, we show that if G is a k-regular graph on n vertices with k at least 4
APA, Harvard, Vancouver, ISO, and other styles
9

Dahme, F., D. Rautenbach та L. Volkmann. "α-Domination perfect trees". Discrete Mathematics 308, № 15 (2008): 3187–98. http://dx.doi.org/10.1016/j.disc.2007.06.043.

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

Alhevaz, Abdollah, Mahsa Darkooti, Hadi Rahbani, and Yilun Shang. "Strong Equality of Perfect Roman and Weak Roman Domination in Trees." Mathematics 7, no. 10 (2019): 997. http://dx.doi.org/10.3390/math7100997.

Full text
Abstract:
Let G = ( V , E ) be a graph and f : V ⟶ { 0 , 1 , 2 } be a function. Given a vertex u with f ( u ) = 0 , if all neighbors of u have zero weights, then u is called undefended with respect to f. Furthermore, if every vertex u with f ( u ) = 0 has a neighbor v with f ( v ) > 0 and the function f ′ : V ⟶ { 0 , 1 , 2 } with f ′ ( u ) = 1 , f ′ ( v ) = f ( v ) − 1 , f ′ ( w ) = f ( w ) if w ∈ V ∖ { u , v } has no undefended vertex, then f is called a weak Roman dominating function. Also, the function f is a perfect Roman dominating function if every vertex u with f ( u ) = 0 is adjacent to exact
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Perfect domination"

1

Egunjobi, Ayotunde. "Perfect Double Roman Domination of Trees." Digital Commons @ East Tennessee State University, 2019. https://dc.etsu.edu/etd/3576.

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

Montana, Giovanni. "Small sets and domination in perfect simulation." Thesis, University of Warwick, 2003. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.397216.

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

嚴劍琴. "Algorithmic aspects of perfect domination." Thesis, 1992. http://ndltd.ncl.edu.tw/handle/41537300805995897905.

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

Liu, Yi Chang, and 劉宜昌. "Polynomial Algorithms for Various Weighted Perfect Domination Problems on Some Classes of Graphs." Thesis, 1993. http://ndltd.ncl.edu.tw/handle/50194900090833887004.

Full text
Abstract:
碩士<br>國立中正大學<br>資訊工程研究所<br>81<br>Given a graph G=(V,E), A, B .lhkeq. V, A is called a perfect dominating set (PD) of B if every vertex of B-A is adjacent to exactly one vertex of A. A is called an independent perfect dominating set (IPD) of B if A is also an independent set. A is a connected perfect dominating set (CPD) of B if A induces a connected subgraph. If the induced subgraph of A has no isolated vertices, A is called a total perfect dominating set (TPD) of B. A is called a (indep
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Perfect domination"

1

Notebooks, Jay Office. Plans for World Domination: Funny Lined Notebook, Office Gag Gift for Coworker, Sarcastic Joke Journal, Cool Humor Birthday Stuff, Diary, Perfect Appreciation Gift. Independently Published, 2020.

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

Notebooks, Fucking Brilliant. Secret Plans for World Domination: Best Fucking Gift, Humor Notebook, Joke Journal, Cool Stuff, Perfect Motivational Gag Gift for Graduation, for Adults, for Entrepeneur, for Women, for Men. Independently Published, 2019.

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

Press, Brown-Eyed Naturals. My Plans for WORLD DOMINATION! : Lined Notebook: Simple, Cute, Lined Notebook, Matte Cover, Unisex, Good Quality, Perfect for Notes, As a Journal, Diary or Tracker, or to Record Ideas. Makes a Great Gift. Independently Published, 2020.

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

Publications, Matthew. My Plan for World Domination: Perfect Graduation Gift. Blank Lined Journal Funny Quote Notebook for Students. Great Alternative to a Card. Meaningful Mother's Day Gift, Gifts for Mom and Sisters,love Gift Your Employees and Friends. Independently Published, 2020.

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

Book chapters on the topic "Perfect domination"

1

Chang, Gerard J., C. Pandu Rangan, and Satyan R. Coorg. "Weighted independent perfect domination on cocomparability graphs." In Algorithms and Computation. Springer Berlin Heidelberg, 1993. http://dx.doi.org/10.1007/3-540-57568-5_282.

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

Wang, Xiaomeng, Shou-Jun Xu, and Xianyue Li. "Independent Perfect Domination Sets in Semi-Cayley Graphs." In Algorithmic Aspects in Information and Management. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-57602-8_39.

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

Gupta, Purnima, Alka, and Rajesh Singh. "Point-Set Domination in Graphs. VIII: Perfect and Efficient PSD Sets." In Theoretical Computer Science and Discrete Mathematics. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-64419-6_38.

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

Hon, Wing-Kai, Ton Kloks, Hsiang-Hsuan Liu, and Hung-Lung Wang. "Rainbow Domination and Related Problems on Some Classes of Perfect Graphs." In Topics in Theoretical Computer Science. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-28678-5_9.

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

Mahadevan, G., V. Vijayalakshmi, and Selvam Aavadayappan. "Interrogation for Modernistic Conceptualization of Complementary Perfect Hop Domination Number with Various Grid Models." In New Trends in Computational Vision and Bio-inspired Computing. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-41862-5_123.

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

Hsieh, Sun-Yuan, Gen-Huey Chen, and Chin-Wen Ho. "An Optimal Parallel Algorithm for the Perfect Dominating Set Problem on Distance-Hereditary Graphs." In Advances in Computing Science ASIAN 98. Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/3-540-49366-2_10.

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

Corneil, Derek G., and Lorna K. Stewart. "Dominating Sets in Perfect Graphs." In Topics on Domination. Elsevier, 1991. http://dx.doi.org/10.1016/s0167-5060(08)71046-x.

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

OKADA, AKIRA. "Perfect Equilibrium Points and Lexicographic Domination." In Game Theory and Applications. Elsevier, 1990. http://dx.doi.org/10.1016/b978-0-12-370182-4.50037-4.

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

du Rivage, Justin. "Conclusion." In Revolution Against Empire. Yale University Press, 2017. http://dx.doi.org/10.12987/yale/9780300214246.003.0009.

Full text
Abstract:
This concluding chapter draws some insights in the aftermath of American independence, arguing that America's revolution against empire was a revolution against domination. But domination was about far more than power; it was about denying people the fruits of their labor. And for that reason, radicals on both sides of the Atlantic contended for a more equal society and a more perfect union. But the reality of American empire proved far more equivocal. The future of the United States was marked by growing inequality and by laws that denied many their dignity and their freedom. Independence created a state strong enough to conquer a continent and robust enough to keep millions in bondage.
APA, Harvard, Vancouver, ISO, and other styles
10

Shepherd, Nick. "The grammar of decoloniality." In Colonial and Decolonial Linguistics. Oxford University Press, 2020. http://dx.doi.org/10.1093/oso/9780198793205.003.0019.

Full text
Abstract:
The iconoclastic impetus to destroy Western colonialism lies at the heart of modern anticolonial practices. This commentary takes a look at decolonizing iconoclasms that are characterized by destruction and removal, mutilation or disfigurement of things, images, or words, perceived to be embodiments and symbols of colonial oppression and domination. Statues and monuments, for instance, figure prominently in this history of decolonization as iconoclastic action. The fantasy of historical rupture from the colonial past inhabits the gesture of the iconoclastic decolonizer. This commentary argues that statues can be seen as decolonial fetishes, whose extinction would be equivalent to the absolute disappearance of an over-domineering “colonialism”; it is as if their physical erasure would create a rupture in human time, inaugurating a perfect new epoch, without imperial idols and forever free from the chains of coloniality. Yet the gestures of destroyers, paradoxically, endow the colonial statues with high powers.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Perfect domination"

1

Martinez, C., R. Beivide, J. Gutierrez, and E. M. Gabidulin. "On the perfect t-dominating set problem in circulant graphs and codes over gaussian integers." In Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. IEEE, 2005. http://dx.doi.org/10.1109/isit.2005.1523333.

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

Pagar, Nitin D., and S. H. Gawande. "Experimental Investigations on Meridional and Circumferential Stresses of Bellows due to Internal Pressure." In ASME 2019 Gas Turbine India Conference. American Society of Mechanical Engineers, 2019. http://dx.doi.org/10.1115/gtindia2019-2771.

Full text
Abstract:
Abstract Bellows Expansion joints are mostly linked with the piping connections of turbines, heat exchangers, process equipment’s etc. Its primary function is to absorb expansion and contraction in pipelines on which it is fixed and fulfill its functioning through peculiar springy shaped convolutions. At design stage, it is very difficult to guess fatigue life cycles due to evolved stresses in convolutions. When it is subjected to purely axial load, stress generation per convolution acting along longitudinal line is same; however the behavior is different under very small angular rotation and
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!

To the bibliography