Catalogue Search | MBRL
Are you sure you want to remove the book from the shelf?
{{itemTitle}}
5,817
result(s) for
"Domination"
Sort by:
The evils of polygyny : evidence of its harm to women, men, and society
\"One powerful structural factor which enforces and replicates patterns of male dominance is the practice of polygyny, which is shown by data to be harmful to women, children, men, and society\"-- Provided by publisher.
Book
Graph Theoretic Insights into Corona Domination and Cartesian Products
In this article we provide a contribution to study the corona domination number( CD -number) for the Cartesian product of graphs. A dominating set S of a graph H is said to be a corona dominating set ( CD – set ) if every vertex in ⟨ S ⟩ 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 γ CD ( H ). Also the characterization of Cartesian product of some graphs in terms of this parameter were discussed and the exact γ CD value for the graphs consider in the article are identified using some number theory technique.
Journal Article
Gender, agency, and coercion
Drawing on recent feminist discussions, this collection critically reassesses ideas about agency, exploring the relationship between agency and coercion in greater depth and across a range of disciplinary perspectives and ethical contexts.
Book
Love, Intimacy and Power
Through an analysis of the correspondence of over one hundred couples from the Scottish elites across the seventeenth to nineteenth centuries, this book explores how ideas around the nature of emotional intimacy, love, and friendship within marriage adapted to a modernising economy and society. Patriarchy continued to be the central model for marriage across the period and as a result, women found spaces to hold power within the family, but could not translate it to power beyond the household. Comparing the Scottish experience to that across Europe and North America, Barclay shows that throughout the eighteenth-century, far from being a side-note in European history, Scottish ideas about gender and marriage became culturally dominant. This book will be vital to those studying and teaching Scottish social history, and those interested in the history of marriage and gender. It will also appeal to feminists interested in the history of patriarchy.
eBook
Invisible women : data bias in a world designed for men
\"Data is fundamental to the modern world. From economic development, to healthcare, to education and public policy, we rely on numbers to allocate resources and make crucial decisions. But because so much data fails to take into account gender, because it treats men as the default and women as atypical, bias and discrimination are baked into our systems. And women pay tremendous costs for this bias, in time, money, and often with their lives. Celebrated feminist advocate Caroline Criado Perez investigates the shocking root cause of gender inequality and research in Invisible Women, diving into women's lives at home, the workplace, the public square, the doctor's office, and more. Built on hundreds of studies in the US, the UK, and around the world, and written with energy, wit, and sparkling intelligence, this is a groundbreaking, unforgettable exposâe that will change the way you look at the world.\"--provided by publisher.
Book
Changing and Unchanging strong efficient edge domination number of some standard graphs when a vertex is removed or an edge is added
Let G=(V,\\ E) be a simple graph. A subset S of E(G) is a strong (weak) efficient edge dominating set of G if │Ns[e] S│ = 1 for all e E(G)(│Nw[e] S│ = 1 for all e E(G)) where Ns(e) ={f / f E(G), f is adjacent to e & deg f ≥ deg e}(Nw(e) ={f / f E(G), f is adjacent to e & deg f ≤ deg e}) and Ns[e]=Ns(e){e}(Nw[e] = Nw(e){e}). The minimum cardinality of a strong efficient edge dominating set of G (weak efficient edge dominating set of G) is called a strong efficient edge domination number of G and is denoted by {\\gamma\\prime}_{se}(G) ({\\gamma^\\prime}_{we}(G)).When a vertex is removed or an edge is added to the graph, the strong efficient edge domination number may or may not be changed. In this paper the change or unchanged of the strong efficient edge domination number of some standard graphs are determined, when a vertex is removed or an edge is added.
Journal Article
Stability of Domination in Graphs
The stability of dominating sets in Graphs is introduced and studied, in this paper. Here D is a dominating set of Graph G. In this paper the vertices of D and vertices of V - D are called donors and acceptors respectively. For a vertex u in D, let \\psi_{D}(u) denote the number \\|N(u) \\cap (V - D)\\|. The donor instability or simply d- instabilityd^{D}_{inst}(e)of an edge e connecting two donor vertices v and u is\\|\\psi_{D}(u)-\\psi_{D}(v)\\|. The d-instability of D,\\psi_{d}(D) is the sum of d-instabilities of all edges connecting vertices in D. For a vertex u not in D, let \\phi_{D}(u) denote the number\\|N(u)\\cap D\\|. The Acceptor Instability or simply a-instability a^{D}_{inst}(e) of an edge e connecting two acceptor vertices u and v is \\|\\phi_{D}(u)-\\phi_{D}(v)\\|. The a-instability of D, \\phi_{a}(D) is the sum of a-instabilities of all edges connecting vertices in V - D. The dominating set D is d-stable if \\psi_{d}(D) = 0 and a-stable if \\phi_{a}(D) = 0. D is stable, if \\psi_{d}(D) = 0 and \\psi_{a}(D) = 0. Given a non negative integer #α, D isα-d-stable, ifd^{D}_{inst}(e)\\leqαfor any edge e connecting two donor vertices and D isα-a-stable, ifa^{D}_{inst}(e)\\leqαfor any edge e connecting two acceptor vertices. Here we studyα- stability number of graphs for non negative integerα$.
Journal Article
The witches are coming
\"From the moment powerful men started falling to the #MeToo movement, the lamentations began: this is feminism gone too far, this is injustice, this is a witch hunt. You think this is a witch hunt? Fine. You've got one. In a laugh-out-loud, incisive cultural critique, West extolls the world-changing magic of truth, urging readers to reckon with dark lies in the heart of the American mythos, and unpacking the complicated, and sometimes tragic, politics of not being a white man in the twenty-first century. She tracks the misogyny and propaganda hidden (or not so hidden) in the media she and her peers devoured growing up, a buffet of distortions, delusions, prejudice, and outright bullsh*t that has allowed white male mediocrity to maintain a death grip on American culture and politics-and that delivered us to this precarious, disorienting moment in history.\"-- Publisher's description.
Book
Relatively Prime Inverse Domination On Line Graph
Let G be non-trivial graph. A subset D of the vertex set V (G) of a graph G is called a dominating set of G if every vertex in V − D is adjacent to a vertex in D. The minimum cardinality of a dominating set is called the domination number and is denoted by γ(G). If V −D contains a dominating set S of G, then S is called an inverse dominating set with respect to D. In an inverse dominating set S, every pair of vertices u and v in S such that (degu, degv) = 1, then S is called relatively prime inverse dominating set. The minimum cardinality of a relatively prime inverse dominating set is called relatively prime inverse dominating number and is denoted by γ −1 rp (G). In this paper we find relatively prime inverse dominating number of some line graphs.
Journal Article