Search

Let G = (V , E) be a graph. A set S ⊆ V is a total restrained dominating set if every vertex is adjacent to a vertex in S , and every vertex in V − S is adjacent to a vertex in V − S. The total restrained domination number of G , denoted γ t r (G) , is the smallest cardinality of a total restrained dominating set of G. In this paper we show that if G is a K 1 , ℓ -free graph with δ ≥ ℓ ≥ 3 and δ ≥ 5 , then γ t r (G) ≤ n 1 − (2 δ − 3) (2 δ) δ δ − 1 + o δ (1) . [ABSTRACT FROM AUTHOR]

Let G be a graph and H be a connected graph. A subset D ⊆ V (G) is called an H -isolating set of G if G − N [ D ] contains no H as a subgraph. The H -isolation number of G , denoted by ι (G , H) , is the minimum cardinality of an H -isolating set in G. For an integer k ≥ 0 , a K 1 , k + 1 -isolating set of G is simply said to be a k -isolating set of G , and ι (G , K 1 , k + 1) is abbreviated to ι k (G) , called the k -isolation number of G. Thus, ι k (G) is the minimum cardinality of a k -isolating set D such that Δ (G − N [ D ]) ≤ k. We prove that if G is a connected graph of size m , then ι k (G) ≤ m + 1 k + 3 , unless G ≅ K 1 , k + 1 , or k = 1 and G ≅ C 6 . The extremal graphs are completely characterized. Moreover, it is proved that for any graph G with s components, ι (G , H) ≤ γ (H) m (G) + s m (H) + 1 . Several conjectures are proposed in the closing, where γ (H) is the domination number of H. [ABSTRACT FROM AUTHOR]

Copyright of Baghdad Science Journal is the property of Republic of Iraq Ministry of Higher Education & Scientific Research (MOHESR) and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Baghdad Science Journal is the property of Republic of Iraq Ministry of Higher Education & Scientific Research (MOHESR) and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Domination and its associated concepts are significant ideas in fuzzy graph theory that have applications in diverse fields such as neural networks, game theory, and telecommunication. This study presents the notions of dominance and its associated research in a broader form of fuzzy graph called the multidimensional fuzzy graph. Basic results, such as the relationship between these parameters and vertices, edges, minimal sets, and so forth, are identified and illustrated with appropriate examples. The dominance number of multidimensional fuzzy graphs is determined after undergoing operations such as direct product, tensor product, composition, join, and others. Ultimately, this study displays a decision-making problem that can be efficiently addressed by utilizing the concept of the dominance number. The effectiveness of this approach is then compared to various models, like m-polar fuzzy sets. [ABSTRACT FROM AUTHOR]

The domination (number) of a graph  G = (V , E) , denoted by  γ (G) , is the size of the minimum dominating sets of  V (G) , also known as  γ -sets. As such, the dominion of G, denoted by  ζ (G) , counts all its  γ -sets. We proved a conjecture from one of the authors on the dominion of cycles  C 3 k − 1  and  C 3 k − 2 ,  k ≥ 2 . Further, we found the formulae and recurrence relations for the dominions of several grids,  G m , n , with  2 ≤ m ≤ 4  and other results when  m ≤ 9  and  n ≤ 20 . In general, domination and dominion play important roles in assessing certain vulnerabilities of any given network system. [ABSTRACT FROM AUTHOR]

For a simple, undirected graph G (V , E) without isolated vertices, a function h : V → { ϕ , { 1 } , { 2 } , { 1 , 2 } } which satisfies the following two conditions is called a total 2-rainbow dominating function (T2RDF) of G. (i) For all u ∈ V , if h (u) = ϕ then ∪ v ∈ N (u) h (v) = { 1 , 2 } and (ii) Every u ∈ V with h (u) ≠ ϕ is adjacent to a vertex v with h (v) ≠ ϕ. The weight of a T2RDF h of G is the value h (V) = ∑ u ∈ V | h (u) |. The total 2-rainbow domination number is the minimum weight of a T2RDF on G and is denoted by γ t r 2 (G). The minimum total 2-rainbow domination problem (MT2RDP) is to find a T2RDF of minimum weight in the input graph. In this article, we show that the problem of deciding if G has a T2RDF of weight at most l for star convex bipartite graphs, comb convex bipartite graphs, split graphs and planar graphs is NP-complete. On the positive side, we show that MT2RDP is linear time solvable for threshold graphs, chain graphs and bounded tree-width graphs. On the approximation point of view, we show that MT2RDP cannot be approximated within (1 −) ln | V | for any > 0 unless P=NP and also propose 2 (ln (Δ − 0. 5) + 1. 5) -approximation algorithm for it. Further, we show that MT2RDP is APX-complete for graphs with maximum degree 4. Next, it is shown that domination problem and the total 2-rainbow domination problems are not equivalent in computational complexity aspects. Finally, an integer linear programming formulation for MT2RDP is presented. [ABSTRACT FROM AUTHOR]

An isolating set in a graph is a set X of vertices such that every edge of the graph is incident with a vertex of X or its neighborhood. The isolation number of a graph, or equivalently the vertex-edge domination number, is the minimum number of vertices in an isolating set. Caro and Hansberg, and independently Żyliński, showed that the isolation number is at most one-third the order for every connected graph of order at least 6. We show that in fact all such graphs have three disjoint isolating sets. Further, using a family introduced by Lemańska, Mora, and Souto-Salorio, we determine all graphs with equality in the original bound. [ABSTRACT FROM AUTHOR]

Tuberculosis (TB) is a global health concern caused by the bacterium Mycobacterium tuberculosis. This infectious disease primarily affects the lungs but can also impact other organs. Effective TB control involves early diagnosis, appropriate treatment with a combination of antibiotics, and public health measures to prevent transmission. However, ongoing challenges include drug-resistant strains and socioeconomic factors influencing its prevalence. Drugs such as isoniazid, pyrazinamide, ethambutol, ethionamide, linezolid, and levofloxacin are approved for the treatment of drug-susceptible tuberculosis. The properties and other activities of the drug, can be analyzed by modelling its chemical structure in terms of a molecular graph , by considering the atoms as the vertex set and the bonds between the two atoms as the edge set . A molecular descriptor or topological index of represents the corresponding chemical molecule as a numerical value. Domination is one of the key concepts in the molecular structure used to analyze the properties of atoms. In this article, the domination distance-based topological indices of the drugs isoniazid, pyrazinamide, ethambutol, ethionamide, linezolid, and levofloxacin are computed to conduct QSPR (Quantitative Structure–Property Relationship) analysis, exploring their physicochemical and ADMET (Absorption, Distribution, Metabolism, Excretion, and Toxicity) properties. Quadratic regression is then used in the QSPR analysis to examine the physicochemical and ADMET properties of these drugs. The results of this analysis indicate that the domination Schultz index and domination SM index are the indices most strongly correlated with the majority of the physicochemical and ADMET properties. The QSPR analysis can also be extended to analogs of these drugs and to other treatment drugs, such as rifampin and rifapentine, to further explore their properties. [ABSTRACT FROM AUTHOR]

The domination problem and three of its variants (total domination, 2-domination, and secure domination) are considered. These problems have various real-world applications, including error correction codes, ad hoc routing for wireless networks, and social network analysis, among others. However, each of them is NP-hard to solve to provable optimality, making fast heuristics for these problems desirable. There are a wealth of highly developed heuristics and approximation algorithms for the domination problem; however, such heuristics are much less common for variants of the domination problem. We redress this gap in the literature by proposing a novel implementation of the cross-entropy method that can be applied to any sensible variant of domination. We present results from experiments that demonstrate that this approach can produce good results in an efficient manner even for larger graphs and that it works roughly as well for any of the domination variants considered. [ABSTRACT FROM AUTHOR]

L'emprise est la réduction de l'autre au statut d'objet, l'anéantissement de sa subjectivité par le déni de ses besoins et désirs, au profit des siens propres. Elle passe par l'appropriation de l'autre, sa dépossession et sa domination. Exercée au sein du couple, elle se traduit par d'importantes violences psychologiques, parfois supplées de violences physiques et sexuelles qui participent à rendre la victime dépendante et dépourvue d'estime d'elle-même. L'emprise représente donc un enjeu majeur dans la lutte contre les violences conjugales dont les professionnels de soin, de la justice et du social doivent se saisir. Notion complexe, elle s'explique par divers mécanismes criminologiques et victimologiques. Certaines caractéristiques du fonctionnement psychologique, certains troubles psychiques et traits de la personnalité constituent des facteurs de risque à exercer l'emprise ou à en être victime. La qualité de la relation aux figures d'attachement, l'image de soi, l'accès à la mentalisation, le rapport aux émotions sont autant de facteurs représentant à la fois l'étiologie et les axes de prise en soin des victimes et auteurs d'emprise. Ici, nous proposons des pistes claires et concrètes pour comprendre le profil des victimes et auteurs d'emprise afin d'adapter au plus juste notre positionnement et la prise en charge, l'objectif étant d'offrir à nos patients la perspective d'un mode de relation à l'autre sain, et la possibilité pour les victimes de sortir de ce cycle destructeur. Nous pouvons tous, soignants, travailleurs sociaux et professionnels de la justice, contribuer, en synergie et en collaboration, au processus de reconstruction des victimes et à la prévention de la récidive des auteurs. Psychological domination is the reduction of the other person to the status of an object, the annihilation of their subjectivity by denying their needs and desires in favor of the dominator's own. It involves appropriating, dispossessing and dominating the other person. When it occurs within a couple, it takes the form of significant psychological violence, sometimes supplemented by physical and sexual violence which creates a strong dependency and affects the victim's self-esteem. Psychological control is therefore a major issue in the fight against domestic violence which healthcare, legal and social professionals must address. This complex concept can be explained by various criminological and victimological mechanisms. Certain characteristics of psychological functioning, psychological disorders and personality traits constitute risk factors that enable exercising such control or becoming a victim. The quality of the relationship with attachment figures, self-image, access to mentalization, and the relationship with emotions are all factors representing both the etiology and avenues of psychological care for victims and perpetrators of control. In this article, we propose clear and concrete guidelines for understanding the profile of both victims and perpetrators of psychological domination so that we can adapt our perspectives and treatment as accurately as possible. Our goal is to offer our patients the prospect of a healthy relationship with others, and the possibility for victims to break free from this destructive cycle. All of us – caregivers, social workers, and legal professionals – can work in synergy and collaboration to help victims rebuild their lives and prevent perpetrators from repeating their offenses. [ABSTRACT FROM AUTHOR]

The strong nonsplit domsaturation number of a graph G , d s sns (G) is the least positive integer k such that every vertex of G lies in a strong nonsplit dominating set of cardinality k. In this paper, we obtain certain bounds for d s sns (G) and characterize the graphs which attain these bounds. [ABSTRACT FROM AUTHOR]

The graph parameter domination is considered perhaps one of the fastest-growing areas in graph theory since the fundamental efforts of Berge and Ore in 1962. The domination number of a graph may be determined using the parameter neighbor-component order connectivity which is defined as the minimum number of nodes such that removing these nodes and their adjacent neighbors ensure all remaining components have order less than some given threshold value. Given a threshold value of one, the neighbor-component order connectivity of a graph is equivalent to the well-known parameter domination number of the graph. The problem of computing the domination number of an arbitrary graph is NP-hard, and computing neighbor-component order connectivity of a graph for an arbitrary threshold value is also NP-hard. We will look at the organizational structure of a unicycle graph which aids in modeling the vulnerability of a communication network. In order to assess the vulnerability of this network, we present a polynomial algorithm for computing the neighbor-component order connectivity of a unicycle. We also note that this algorithm covers the case of a threshold value of one and offers an algorithm for the domination number of the unicycle. [ABSTRACT FROM AUTHOR]

Let G = (V, E) be a connected graph. A subset S of V is called a γ-free set if there exists a γ-set D of G such that S ∩ D = ∅. If further the induced subgraph H = G[V − S] is connected, then S is called a cc-γ-free set of G. We use this concept to identify connected induced subgraphs H of a given graph G such that γ(H) ≤ γ(G). We also introduce the concept of γ-totally-free and γ-fixed sets and present several basic results on the corresponding parameters. [ABSTRACT FROM AUTHOR]

A dominating set in a graph G is a set S of vertices such that every vertex in V(G)⧹S is adjacent to a vertex in S. A restrained dominating set of G is a dominating set S with the additional restraint that the graph G−S obtained by removing all vertices in S is isolate‐free. The domination number γ(G) and the restrained domination number γr(G) are the minimum cardinalities of a dominating set and restrained dominating set, respectively, of G. Let G be a cubic graph of order n. A classical result of Reed states that γ(G)≤38n, and this bound is best possible. To determine the best possible upper bound on the restrained domination number of G is more challenging, and we prove that γr(G)≤25n. [ABSTRACT FROM AUTHOR]

Let G be some simple graph and k be any positive integer. Take h : V (G) → { 0 , 1 , … , k + 1 } and v ∈ V (G) , let A N h (v) denote the set of vertices w ∈ N G (v) with h (w) ≥ 1 . Let A N h [ v ] = A N h (v) ∪ { v } . The function h is a [k]-Roman dominating function of G if h (A N h [ v ]) ≥ | A N h (v) | + k holds for any v ∈ V (G) . The minimum weight of such a function is called the k-th Roman Domination number of G, which is denoted by γ kR (G) . In 2020, Banerjee et al. presented linear time algorithms to compute the double Roman domination number on proper interval graphs and block graphs. They posed the open question that whether there is some polynomial time algorithm to solve the double Roman domination problem on interval graphs. It is argued that the interval graph is a nontrivial graph class. In this article, we design a simple dynamic polynomial time algorithm to solve the k-th Roman domination problem on interval graphs for each fixed integer k > 1 . [ABSTRACT FROM AUTHOR]

A Roman { 3 } -dominating function on a graph G is a function f : V (G) → { 0 , 1 , 2 , 3 } having the property that for any vertex u ∈ V (G) , if f (u) = 0 , then ∑ v ∈ N G (u) f (v) ≥ 3 , and if f (u) = 1 , then ∑ v ∈ N G (u) f (v) ≥ 2. The weight of a Roman { 3 } -dominating function f is the sum f (V (G)) = ∑ v ∈ V (G) f (v) and the minimum weight of a Roman { 3 } -dominating function on G is called the Roman { 3 } -domination number of G and is denoted by γ { R 3 } (G). Given a graph G , Roman { 3 } - domination asks to find the minimum weight of a Roman { 3 } -dominating function on G. In this paper, we study the algorithmic aspects of Roman { 3 } - domination on various graph classes. We show that the decision version of Roman { 3 } - domination remains NP -complete for chordal bipartite graphs, planar graphs, star-convex bipartite graphs, and chordal graphs. We show that Roman { 3 } - domination cannot be approximated within a ratio of (1 3 − ɛ) ln | V (G) | for any ɛ > 0 unless P = NP for bipartite graphs as well as chordal graphs, whereas Roman { 3 } - domination can be approximated within a factor of O (ln Δ) for graphs having maximum degree Δ. We also show that Roman { 3 } - domination is APX -complete for graphs with maximum degree 4. On the positive side, we show that Roman { 3 } - domination can be solved in linear time for chain graphs and cographs. [ABSTRACT FROM AUTHOR]

Harmony is a crucial value for resolving conflicts. Discussions on harmony in the Zhuangzi primarily focus on harmonizing ‘right and wrong’ (shifei 是非). However, it represents only a superficial understanding of Zhuangzian harmony. To explore a fundamental form of harmony would be beneficial: harmonizing ‘virtuosities’ (de 德), which can prevent conflicts and avoid domination. This paper begins by illustrating the discombobulated (zhili 支离) characteristic of virtuosities in the Zhuangzi. By comparison with harmonizing virtues in Five Conducts, we can better understand the distinctive characteristic of harmonizing virtuositiesin the Zhuangzi. Moreover, a metaphor of perfectly still water suggests that in this process, virtuosities can be internally preserved and externally unshaken. This suggests to maintain one’s own virtuosities in the transformations of eventsand avoidacquiring specific names or reputations that can lead to interpersonal conflicts and domination. These two characteristics can fundamentally avoid disputes over ‘right and wrong’. [ABSTRACT FROM AUTHOR]

AbstractIn 2021, we introduced one type of the generalization of dominator coloring via packing coloring and distance domination. In this paper, we present a second type of such generalization, namely distance dominator packing coloring of type II, defined as follows. A coloring c is a k-distance dominator packing coloring of type II of G if it is a k-packing coloring of G and for each u ∈ V (G) there exists i ∈ {1, 2, 3, . . . , k} such that u c(u)-distance dominates each vertex from the color class of color i (i.e., the distance between u and all vertices from color class of color i is at most c(u)). The smallest integer k such that there exists a k-distance dominator packing coloring of G is the distance dominator packing chromatic number of type II of G, denoted by . In this paper, we provide some lower and upper bounds on the distance dominator packing chromatic number of type II, characterize connected graphs G with , and consider the relation between the packing coloring, distance dominator packing coloring of type I (introduced by Ferme and Mesarič Štesl in 2021) and distance dominator packing coloring of type II for a given graph. [ABSTRACT FROM AUTHOR]

Influence maximization plays an important role in social network analysis and has been extensively explored due to its emergence in a great deal of applications. However, a vast majority of researchers have only considered the influence of one factor on the spread of information among individuals. In addition, this factor which is mainly the influence probability, has been considered to be fixed which is estimated based on the number of neighbors of each individual. While, in reality, we do not have complete information about this probability and it is not a fixed value. Moreover, in the spread of information, other factors including trust, are also involved, which cannot be easily combined due to their different nature. In this paper, a dominance approach to influence maximization is studied under the condition, in which, complete information about influence of users on each other is not available and users infect each other based on an unknown influence probability. Furthermore, in order to make the proposed model closer to reality, trust factor is also considered as an independent factor. The proposed method is compared to several state-of-the-art influence maximization algorithms and attained results on several synthetic and real social network datasets verify effectiveness of the proposed method compared to previous methods in the context of influence maximization. [ABSTRACT FROM AUTHOR]

This article theorizes and establishes some of the outlines of an epistemology of domination. An epistemology of domination interpellates the question of "how/what does the oppressor know about the oppressed?" Drawing on several studies of cultural encounters such as Ibrahim Abu-Lughod's The Arab Rediscovery of Europe , Ashis Nandy's The Intimate Enemy , and Zeynep Çelik's Europe Knows Nothing about the Orient , the discussion explores epistemic tropes around colonial encounters: the power and politics of representation; the burden of belatedness/the denial of coevalness; the over-emphasizing of Western agency. Wlad Godzich states that "Western Thought has always thematized the other as a threat to be reduced, as a potential same-to-be, a yet-not-same." My discussion here accepts this premise but only partially, and asks the question: does domination always entail the projection of alterity as a threat, or is there a wider spectrum of epistemic projections? How does the other encounter and experience the Western self, and does such encounter modify hegemonic epistemological paradigms? Following Michel de Certeau's assertion that "what is near masks a foreignness," I seek to complicate the relation between selfhood and otherness in the colonial encounter, and its entanglements with colonial violence. What pedagogical moments emerge from such encounters? And how do such pedagogical moments structure postcolonial epistemologies? [ABSTRACT FROM AUTHOR]

A set D ⊆ V of a graph G = (V , E) is called a connected power dominating set of G if G [ D ] , the subgraph induced by D , is connected and every vertex in the graph can be observed from D , following the two observation rules for power system monitoring: Rule 1 : if v ∈ D , then v can observe itself and all its neighbors, and Rule 2 : for an already observed vertex whose all neighbors except one are observed, then the only unobserved neighbor becomes observed as well. Given a graph G , Minimum Connected Power Domination is to find a connected power dominating set of minimum cardinality of G and Decide Connected Power Domination is the decision version of Minimum Connected Power Domination. Decide Connected Power Domination is known to be N P -complete for general graphs. In this paper, we prove that Decide Connected Power Domination remains N P -complete for star-convex bipartite graphs, perfect elimination bipartite graphs and split graphs. This answers some open problems posed in [B. Brimkov, D. Mikesell and L. Smith, Connected power domination in graphs, J. Comb. Optim. 38(1) (2019) 292–315]. On the positive side, we show that Minimum Connected Power Domination is polynomial-time solvable for chain graphs, a proper subclass of perfect elimination bipartite graph, and for threshold graphs, a proper subclass of split graphs. Further, we show that Minimum Connected Power Domination cannot be approximated within (1 −) ln | V | for any > 0 unless P = N P , for bipartite graphs as well as for chordal graphs. Finally, we show that Minimum Connected Power Domination is APX -hard for bounded degree graphs. [ABSTRACT FROM AUTHOR]

The notion of Roman { 2 } -domination was introduced in 2016 as a variant of Roman domination, a concept inspired by a defending strategy used by the emperor Constantine (272–337 AD) to protect the Roman Empire. Since then, a considerable number of papers on Roman { 2 } -domination and its variants have been published. In this paper, we survey published results on Roman { 2 } -domination as well as the main findings on Roman { 2 } -domination variants found in the literature. A list of open problems related to this notion and its variants are also given. [ABSTRACT FROM AUTHOR]

The purpose of this research study is to examine the feminism-related aspects of Anita Nair's Lessons in Forgetting. It discusses a variety of issues that the female characters in the book deal with, including female feticide, gender discrimination, love and dependence on family members. It also provides a brief explanation of how these issues are resolved so that the characters can move on with their lives. According to the title, women forget the lessons they were taught in order to live the life they want. Feminism is based on happiness and expectations rather than anxieties and sadness. Struggling against patriarchal culture has become dated because women have forged ahead unafraid to improve things in their own manner. The main protagonist Meera and other female characters use it as a tool to consider what would happen following their husbands' betrayal. Due to male-controlled norms in India, a traditional and conservative nation, women have never been given the respect they deserve. They have been taught that the pains and joys of others determine their worth. The perspectives of their goals and aspirations are framed by their moral and ethical commitments. The study has made an effort to identify feminism-related components in novels that shed light on certain significant issues related to women's ongoing struggles against the misery, abuse and trauma that they experience as a result of the male-dominated conservative culture. The freedom of the woman to fulfil her different conventional responsibilities as a daughter, wife, mother and other things is explored in Nair. The concept of selfdiscovery, which is central to her works, is also addressed in this study. [ABSTRACT FROM AUTHOR]

In this paper, we extend the findings of recent studies on k-rainbow total domination by placing our focus on its computational complexity aspects. We show that the problem of determining whether a graph has a 2-rainbow total dominating function of a given weight is NP-complete. This complexity result holds even when restricted to planar graphs. Along the way tight bounds for the k-rainbow total domination number of rooted product graphs are established. In addition, we obtain the closed formula for the k-rainbow total domination number of the corona product G ∗ H , provided that H has enough vertices. [ABSTRACT FROM AUTHOR]

This research is one of the first studies to clarify how employees in the hospitality industry obey or resist to labour exploitation and domination, using Pierre Bourdieu's field theory. We collected data through semi-structured interviews with tourism employees in Antalya, a major tourist city in Türkiye. The findings show widespread exploitation and domination, with employees often complying due to benefits promised, fear of unemployment, oppression, loyalty, legal shortcomings, and a lack of organised resistance. Nonetheless, they resist through daily practices, categorised as individual or collective, explicit or implicit, and violent or non-violent. This study concludes that obedience and resistance help sustain exploitation and domination in the field. It offers insight that could contribute to liberating individuals by exposing power dynamics and has significant implications for putting into effect true democracy in hotel businesses. [ABSTRACT FROM AUTHOR]

Let R be a commutative ring with identity. The intersection graph of ideals of a ring R is an undirected simple graph denoted by Γ (R) whose vertices are in a one-to-one correspondence with non-zero proper ideals and two distinct vertices are joined by an edge if and only if the corresponding ideals of R have a non-zero intersection. Let M be a unitary R-module and let R ⋉ M be the idealization of M in R. In this paper, we investigate the interplay between the algebraic properties of R ⋉ M and the graph-theoretic properties of Γ (R ⋉ M) . Under some conditions on the ring R and the module M, we determine the exact form of ideals of R ⋉ M and characterize all rings R and modules M for which Γ (R ⋉ M) is a star graph. Also, we give a necessary and sufficient condition under which R ⋉ M is uniform and then we conclude that when Γ (R ⋉ M) is a complete graph. Among other results, some graph-theoretic properties of Γ (R ⋉ M) such as domination number, connectedness and grith are obtained. [ABSTRACT FROM AUTHOR]

Hannah Arendt is commonly criticized for defining action as an end in itself, of horizontal power and of councils as an alternative to representative democracy that is unrealistic and unrealizable. In contrast, I show how much Arendt was concerned about the dangers of these concepts: the replacement of action by fabrication, of power by domination and violence, and the impossibility of a council democracy in the face of a highly administrative and depoliticized society. Arendt shows how these hybrid forms revealed their pure forms as a hidden tradition in revolutionary situations. The supposed incompleteness and failure of a struggle for another society can therefore be understood as a recurring possibility and reality and thus as a specific condition of the political. The critique of the hybrid form also includes the critique of modern scientific thought and political thought.

Abstract Tuberculosis (TB) is a global health concern caused by the bacterium Mycobacterium tuberculosis. This infectious disease primarily affects the lungs but can also impact other organs. Effective TB control involves early diagnosis, appropriate treatment with a combination of antibiotics, and public health measures to prevent transmission. However, ongoing challenges include drug-resistant strains and socioeconomic factors influencing its prevalence. Drugs such as isoniazid, pyrazinamide, ethambutol, ethionamide, linezolid, and levofloxacin are approved for the treatment of drug-susceptible tuberculosis. The properties and other activities of the drug, can be analyzed by modelling its chemical structure in terms of a molecular graph $$G=\left(V,E\right)$$ , by considering the atoms as the vertex set $$V\left(G\right)$$ and the bonds between the two atoms as the edge set $$E\left(G\right)$$ . A molecular descriptor or topological index of $$G$$ represents the corresponding chemical molecule as a numerical value. Domination is one of the key concepts in the molecular structure used to analyze the properties of atoms. In this article, the domination distance-based topological indices of the drugs isoniazid, pyrazinamide, ethambutol, ethionamide, linezolid, and levofloxacin are computed to conduct QSPR (Quantitative Structure–Property Relationship) analysis, exploring their physicochemical and ADMET (Absorption, Distribution, Metabolism, Excretion, and Toxicity) properties. Quadratic regression is then used in the QSPR analysis to examine the physicochemical and ADMET properties of these drugs. The results of this analysis indicate that the domination Schultz index and domination SM index are the indices most strongly correlated with the majority of the physicochemical and ADMET properties. The QSPR analysis can also be extended to analogs of these drugs and to other treatment drugs, such as rifampin and rifapentine, to further explore their properties.

L'objectif de cet article est de décrire la manière dont la sortie annoncée de prison précipite le travail de liaison dans les derniers temps du travail psychothérapeutique et d'en illustrer les modalités transférentielles. Nous questionnons plus précisément les destins et fonctions de ce que nous proposons de nommer une « temporalité hallucinatoire » en psychothérapie, à l'aube de l'annonce de la sortie de prison. Pour illustrer nos propos nous nous appuierons sur le cas de Joël, incarcéré pour des faits de vol avec violence, en état de récidive légale. Il s'agit d'un patient suivi en psychothérapie hebdomadaire en milieu carcéral, et rencontré en unité de soins, dans les quelques mois qui ont précédé sa sortie. Dans le cadre de cet article, nous avons souhaité illustrer la manière dont la sortie de prison, en négatif du choc à l'incarcération, peut retentir sur la vie fantasmatique du sujet, entre anticipation et réalisation pulsionnelle. Les défenses mobilisées par Joël, en entretien, nous paraissent particulièrement pertinentes dans la manière dont elles appuient sur la poussée pulsionnelle au service de la montée en tension, produisant alors un effet de renversement du pôle passif au pôle actif jusque dans le temps de la séance. Cette temporalité surinvestie sur ses seuils de risques : entre sortir et rester, nous apparaît dessiner des contours artificiels comme autant de point de buté fantasmatiques pour forcer le système représentationnel au profit d'une circulation hallucinatoire. Les défenses mobilisées par Joël, en entretien, nous ont paru particulièrement pertinentes dans la manière dont elles ont appuyé sur la poussée pulsionnelle au service de la montée en tension, produisant alors un effet de renversement du pôle passif au pôle actif jusque dans le temps de la séance. Cette temporalité surinvestie sur ses seuils de risques : entre sortir et rester, nous apparaissait dessiner des contours artificiels comme autant de point de buté fantasmatiques pour forcer le système représentationnel au profit d'une circulation hallucinatoire aux fonctions masturbatoires. Si, dans la perspective des travaux de Roussillon que nous citions précédemment, nous concevons la symbolisation comme une expérience de subjectivation par l'emprise, il est aisé ici de concevoir la manière dont les remparts du cadre thérapeutique peuvent faire office de carrefour hallucinatoire, au moment tangeant de rêver, ou du moins de tenter d'« halluciner » la sortie. Le soutien de cet espace hallucinatoire : de la circularité temporelle à la temporalité fantasmatique, nous apparaît être favorisé par l'intercontenance mise au travail et décrite par Ciavaldini, jusque dans ses manifestations transférentielles en séance. L'au-delà de la séance, comme « au-delà du mur », mettrait ainsi à l'épreuve la solidité du rempart psychique façonnée par une autre voie que celle de l'emprise. The aim of this article is to describe the way in which the announced release from prison precipitates the work of linking in the final stages of psychotherapeutic work, and to illustrate the transferential modalities involved. More specifically, we examine the fates and functions of what we propose to call a "hallucinatory temporality" in psychotherapy, at the dawn of the announcement of release from prison. To illustrate our ideas, we will use the case of Joël, who has been detained in custody for armed robbery, and is in a state of legal recidivism. This patient was receiving weekly psychotherapy in prison and had been seen in a care unit in the few months prior to his release. In this article, we wanted to illustrate the way in which release from prison, as a negative of the shock of imprisonment, can affect the subject's fantasy life, between anticipation and impulse realization. The defenses mobilized by Joël during the interview seemed to us to be particularly relevant in the way in which they pressed on the drive in the service of the rise in tension, thus producing an effect of reversal from the passive pole to the active pole, even in the time of the session. This temporality, over-invested in its risk thresholds between getting out and staying in, seemed to us to draw artificial contours like so many fantasmatic stopping points to force the representational system in favor of a hallucinatory circulation with masturbatory functions. If, from the perspective of Roussillon's work cited above, we conceive of symbolization as an experience of subjectivation through domination, it is easy here to see how the ramparts of the therapeutic setting can act as a hallucinatory crossroads, at the tempting moment of dreaming, or at least trying to "hallucinate" the way out. The support of this hallucinatory space – from temporal circularity to fantasmatic temporality – seems to us to benefit from the inter-holding put to work and described by Ciavaldini, even in its transferential manifestations in the session. Beyond the session, as "beyond the wall", would thus put to the test the solidity of the psychic rampart fashioned by a path other than that of domination. [ABSTRACT FROM AUTHOR]

This article develops a submerged aspect of James C Scott's work on 'hidden transcripts'. Whereas Scott focused predominantly on the hidden transcripts of the powerless, here we propose a research agenda based upon studying hidden transcripts of the powerful. First, we define our terms. Second, we map existing literature, observing that although plenty of research exists into the public transcripts of dominant and subordinate groups, and that Scott initiated a productive research agenda into the hidden transcripts of powerless groups, research into hidden transcripts of powerful actors is lacking. We identify an assumption within this literature that because existing social institutions are already structured in such a way as to reflect and advance the interests of dominant groups, there is no need for separate spaces to foster the consciousness, cohesivness, and mobilisation of the powerful. Third, we ask how social scientists might study the hidden transcripts of the powerful, and what methodological challenges and opportunities such a research programme might present, identifying in particular the promising avenue of studying what we have chosen to call 'transcripts hidden in plain sight'. Fourth, and finally, we question the epistemological status of these hidden transcripts, focusing on whether they can be used by social researchers as a reliable indicator of the 'true' consciousness of the social group that expresses them. [ABSTRACT FROM AUTHOR]

The prevailing discourse around AI ethics lacks the language and formalism necessary to capture the diverse ethical concerns that emerge when AI systems interact with individuals. Drawing on Sen and Nussbaum’s capability approach, we present a framework formalizing a network of ethical concepts and entitlements necessary for AI systems to confer meaningful benefit or assistance to stakeholders. Such systems enhance stakeholders’ ability to advance their life plans and well-being while upholding their fundamental rights. We characterize two necessary conditions for morally permissible interactions between AI systems and those impacted by their functioning, and two sufficient conditions for realizing the ideal of meaningful benefit. We then contrast this ideal with several salient failure modes, namely, forms of social interactions that constitute unjustified paternalism, coercion, deception, exploitation and domination. The proliferation of incidents involving AI in high-stakes domains underscores the gravity of these issues and the imperative to take an ethics-led approach to AI systems from their inception. [ABSTRACT FROM AUTHOR]

In graph theory, the neutrosophic graph is a new extension of the intuitionistic fuzzy graph and fuzzy graph. It offers greater accuracy and flexibility in scheduling and implementing numerous real-life issues. The introduction of neutrosophic graphs has opened up an excellent opportunity to portray real-world situations with incomplete and ambiguous information. These neutrosophic graph models are used in many industrial and scientific domains to simulate various problems. This article offers a new approach for calculating the total dominating set of a given single-valued neutrosophic graph using neutrosophic strong arcs. An example is illustrated for calculating the total dominating sets of single-valued neutrosophic graphs. Moreover, certain observations related to uniform single-valued neutrosophic graphs are covered and we also suggest an application of a total dominating set in single-valued neutrosophic graphs in the real world. [ABSTRACT FROM AUTHOR]

This article reviews the critical and sociological literature on algorithms and AI in light of anthropocentric social theories of power and its dimensions. Building on the classic conceptual distinction between power to (agency) and power over (domination), I outline two main theorizations of algorithmic agency, which here I call “networked” and “cultural”, and conceptualize four dimensions of algorithmic domination: opaque coercion, computational authority, structural conditioning, and data governmentality.

A matching M in a graph G is an induced matching if the largest degree of the subgraph of G induced by M is equal to one. A dominating induced matching (DIM) of G is an induced matching that dominates every edge of G. It is well known that, if they exist, all dominating induced matchings of G are of the same size. The dominating induced matching number of G, denoted by [Formula: see text], is the size of any dominating induced matching of G. In this paper, we continue the study of dominating induced matchings. We prove that, if G has a DIM, then the induced matching number of G is equal to the independence number of its line graph L(G) and to the edge domination number of G. It is also shown that [Formula: see text], provided that both G and L(G) have a DIM. We also present some bounds on [Formula: see text]. In particular, for a tree T with a DIM we show that [Formula: see text], where l is the number of leaves. Moreover, for a regular graph G we establish some Nordhaus-Gaddum type bounds.

In this paper, we comment and discuss the fifteen replies that interpret, solicit, problematize, and further develop our Critical Naturalism: A Manifesto (Krisis 42(1)), that have been published in Krisis 43(1). In the paper, we address four overarching topics that we see emerging from the replies: Histories and traditions of criticial naturalism; the relation between theory and praxis; the question of what is critical about critical naturalism; and finally the question of utopia. Additionally, we discuss three general types of attitudes that our critics take to the Manifesto.

If G = (V , E) is a (finite and simple) graph, we call an independent set X a gated independent set in G if for each x ∈ X , there exists a neighbor y of x such that (X ∖ { x }) ∪ { y } is an independent set in G. We define the gated independence number gi (G) of G to be the maximum cardinality of a gated independent set in G. We demonstrate that the gated independence number is closely related to both matching and domination parameters of graphs. We prove that the inequalities im (G) ⩽ gi (G) ⩽ m ur (G) hold for every graph G , where im (G) and m ur (G) denote the induced and uniquely restricted matching numbers of G. On the other hand, we show that γ i (G) ⩽ gi (G) and γ pr (G) ⩽ 2 gi (G) for every graph G without any isolated vertex, where γ i (G) and γ pr (G) denote the independence and paired domination numbers. Furthermore, we provide bounds on the gated independence number involving the order, size and maximum degree. In particular, we prove that gi (G) ⩾ n 5 for every n -vertex subcubic graph G without any isolated vertex or any component isomorphic to K 3 , 3 , and gi (B) ⩽ 3 n 8 for every n -vertex connected cubic bipartite graph B. [ABSTRACT FROM AUTHOR]

Notice and consent approaches, being the most prevalent legal frameworks, have in recent years come under fire. I suggest they fail because they rest on a historical approach to privacy justice, whereby the justice of a particular state of affairs is a function of whether each transaction on the way was just. Instead, I make use of a background justice framing. Even where consent is present it is inadequate to secure the values at stake. When we only assess the fairness or freedom of individual information transactions, we fail to see the way many can undercut the very values we seek to secure by requiring consent for disclosures in the first place. I propose a patterned principle to regulate the distribution of individual control over privacy, and to set the background against which individual notice and consent can still play a role, albeit a limited one. [ABSTRACT FROM AUTHOR]

Given a graph G with no isolated vertices, let γ e v (G) , i e v (G) , β e v (G) , γ (G) , γ pr (G) and Γ pr (G) denote the ev-domination number, the independent ev-domination number, the upper independent ev-domination number, the domination number, the paired-domination number and the upper paired-domination number, respectively. It is known that γ e v (G) = i e v (G) = 1 2 γ pr (G) ≤ β e v (G). In this paper, we extend this inequality chain to involve the upper paired-domination number for arbitrary graphs G with no isolated vertices as well as the domination number for trees. Moreover, we show that recognizing well ev-covered graphs (i.e., graphs G with i e v (G) = β e v (G)) is co-NP-complete, solving an open problem posed by Boutrig and Chellali. [ABSTRACT FROM AUTHOR]

Copyright of Materia Arquitectura is the property of Universidad San Sebastian and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Domination is an important factor in determining the robustness of a graph structure. A thorough examination of the graph's topological structure is necessary for analyzing and examining it for various aspects. Understanding the stability of a chemical compound is a significant criterion in chemistry, which necessitates conducting numerous experimental tests. The domination number and power domination number are pivotal in defining a wide range of physical properties, which include physiochemical properties, thermodynamic properties, chemical activities, and biological activities. The one-pentagonal carbon nanocone (1-PCNC) is a member of the carbon nanocone family and has a structure similar to that of honeycomb networks, which are renowned for their robustness. In this paper, we find the domination number and power domination number of 1-PCNC by considering it as an (m-1)-layered infinite graph. [ABSTRACT FROM AUTHOR]

Let G = (V (G), E(G)) be a simple and undirected graph. A dominating set S ⊆ V (G) is called a differentiating odd dominating set if for every vertex v ∈ V (G), |N[v] ∩ S| ≡ 1(mod 2) and NG[u] ∩ S≠ NG[v] ∩ S for every two distinct vertices u and v in V (G). The minimum cardinality of a differentiating odd dominating set of G, denoted by γo D(G), is called the differentiating odd domination number. In this paper, we discuss differentiating odd dominating sets and give bounds or exact values of the differentiating odd domination numbers of some graphs. We give necessary and sufficient conditions for some graphs to admit a differentiating odd dominating set. Moreover, we characterize the differentiating odd dominating sets in graphs resulting from join, corona, and lexicographic product of some graphs and determine the differentiating odd domination numbers of these graphs. [ABSTRACT FROM AUTHOR]

In this paper we study domination between different types of walks connecting two non-adjacent vertices of a graph. In particular, we center our attention on weakly toll walk and lk-path for k ∈ {2, 3}. A walk between two non-adjacent vertices in a graph G is called a weakly toll walk if the first and the last vertices in the walk are adjacent, respectively, only to the second and second-to-last vertices, which may occur more than once in the walk. And an lk-path is an induced path of length at most k between two nonadjacent vertices in a graph G. We study the domination between weakly toll walks, lk-paths (k ∈ {2, 3}) and different types of walks connecting two non-adjacent vertices u and v of a graph (shortest paths, induced paths, paths, tolled walks, weakly toll walks, lk-paths for k ∈ {3, 4}), and show how these give rise to characterizations of graph classes. [ABSTRACT FROM AUTHOR]

This article argues that prevailing accounts of structural injustice, which focus on the way our replication of social practices has unjust consequences for individuals, tend to be insufficiently attentive to the differential power relations within the institutions that structure these practices. For economic exploitation, a structural account would instead locate domination in the operation of the system itself, and would distinguish it from the general constraint characteristic of all social practices as given or inherited. The argument further suggests limits to unitary group agency approaches to corporations, and proposes construing them as artifacts as much as agents, while corporate responsibility would need to better track the division of power between top managers and workers within firms. [ABSTRACT FROM AUTHOR]

What role does propaganda play in the information politics of authoritarian societies, and what is its relationship to censorship? What have we learned from rival accounts in recent literature about why states produce it? While regimes clearly invest in propaganda believing that it is effective, there is still much to learn about whether, when, and how it actually is effective. We first discuss some of the tensions inherent in distinguishing between persuasive and dominating, soft and hard, propaganda. We then review efforts to understand the conditions under which propaganda changes attitudes and/or behavior in terms of propaganda's content, relational factors, aspects of the political environment, and citizens' own predispositions. We highlight the need for more research on propaganda in authoritarian settings, especially on how patterns of its consumption may change amid crises, technological shifts, and direct state interventions. [ABSTRACT FROM AUTHOR]

Let G be a simple connected graph. A dominating set S ⊆ V (G) of G is a restrained dominating set in G if for every v ∈ V (G)S there exists u ∈ V (G)S such that uv ∈ E(G). A restrained dominating set S of G is a 1-movable restrained-dominating set of G if for every v ∈ S either S {v} is a restrained dominating set of G or there exists u ∈ (V(G)S) ∩ N(v) such that (S{v}) ∪ {u} is a restrained dominating set of G. The minimum cardinality of a 1-movable restrained-dominating set in G, denoted by γ¹mr(G), is the 1-movable restrained-domination number of G. In this paper, the 1-movable restrained-dominating sets in the corona of graphs are characterized. Also, the 1-movable restrained-dominationnumbers of these graphs are determined. [ABSTRACT FROM AUTHOR]

The decades between 1960s and 1980s were punctuated by intense anti-colonial and anti-imperialist struggles, the rise of Third World internationalism (both in terms of formal and informal connections), the articulation of viable economic alternatives to those imposed by the West, but also a massive wave of counterrevolution with bloody coups, assassinations, and interventions. Symbolically, the long 1960s started with Patrice Lumumba's assassination and ended in 1980 with Walter Rodney's assassination, and the defeat of the NIEO (New International Economic Order). While numerous analyses have engaged with these assassinations as historical events, this article seeks to provide a theoretical engagement with the phenomenon of Third World assassinations. The author's engagement with this phenomenon aims to broaden the idea, put forth by Quynh Pham and Himadeep Muppidi, of the "anxiety of domination." Drawing on Edward Said, James Baldwin, and Eqbal Ahmad, the article seeks to situate theoretically Third World assassinations within a larger paradigm of colonial/imperial anxiety: these acts of annihilation happened not simply because these individuals were on the opposite ideological divide but because their political vision exceeded the grasp of domination and intelligibility of imperial/colonial power and challenged in fundamental ways the imperially sanctioned "epistemic conformity." [ABSTRACT FROM AUTHOR]