Search Results Heading

MBRLSearchResults

mbrl.module.common.modules.added.book.to.shelf
Title added to your shelf!
View what I already have on My Shelf.
Oops! Something went wrong.
Oops! Something went wrong.
While trying to add the title to your shelf something went wrong :( Kindly try again later!
Are you sure you want to remove the book from the shelf?
Oops! Something went wrong.
Oops! Something went wrong.
While trying to remove the title from your shelf something went wrong :( Kindly try again later!
    Done
    Filters
    Reset
  • Discipline
      Discipline
      Clear All
      Discipline
  • Is Peer Reviewed
      Is Peer Reviewed
      Clear All
      Is Peer Reviewed
  • Series Title
      Series Title
      Clear All
      Series Title
  • Reading Level
      Reading Level
      Clear All
      Reading Level
  • Year
      Year
      Clear All
      From:
      -
      To:
  • More Filters
      More Filters
      Clear All
      More Filters
      Content Type
    • Item Type
    • Is Full-Text Available
    • Subject
    • Publisher
    • Source
    • Donor
    • Language
    • Place of Publication
    • Contributors
    • Location
156 result(s) for "bondage"
Sort by:
Unwound
\"When sensei Ronin Black first encounters Amery Hardwick, the fire in her eyes ignites a sexual spark a thousand times better than the primal rush he used to get from mixed martial arts matches. She accepts his darker edges and admits to him that her desires aren't as wholesome as he believed. And before long, Ronin is grappling with emotions he's never felt before.... Yet despite demanding Amery bare her body and soul to him, Ronin holds a part of himself back. When she learns Ronin's secret and walks out, his life begins to unravel. To regain her trust, he must let go of his pride and prove to her that it's more than passion binding them together. But after their private pleasures are made public, Ronin is unsure if he's the right man for Amery. Can they face the consequences together? Or will their differences rip them apart...?\"-- Provided by publisher.
Bound together
What are the archives of gay and lesbian leather histories, and how have contemporary artists mined these archives to create a queer politics of the present? This book sheds light on an area long ignored by traditional art history and LGBTQ studies, examining the legacies of the visual and material cultures of US leather communities. It discusses the work of contemporary artists such as Patrick Staff, Dean Sameshima, Monica Majoli, AK Burns and AL Steiner, and the artist collective Die Kränken, showing how archival histories and contemporary artistic projects might be applied in a broader analysis of LGBTQ culture and norms. Hanky codes, blurry photographs of Tom of Finland drawings, a pin sash weighted down with divergent histories – these become touchstones for writing leather histories.
Bound
\"Former small-town girl Amery Hardwick is living her dream as a graphic designer in Denver, Colorado. She's focused on building her business, which leaves little time for dating--not that she needs a romantic entanglement to fulfill her. When her friend signs up for a self-defense class as part of her recovery after an attack, Amery joins her for support. That's where she meets him. Ronin Black, owner of the dojo, is so drawn to Amery that he takes over her training--and, in private, her body. A sensei master-artist in erotic bondage, Ronin pushes Amery's sexual boundaries from the start, and with each new, sensation-filled twist of his rope, Amery becomes addicted to the pleasure and to him. But as she willingly gives herself to his sensual domination, Amery begins to sense a secret side to Ronin that he hasn't dared to share--something that makes her question her trust in him, no matter how thrilling her obsession has become\"-- Provided by publisher.
The isolate bondage number of a graph
A set D of vertices in a graph G is a dominating set, if each vertex of G that is not in D is adjacent to at least one vertex of D . The minimum cardinality among all dominating sets in G is called the domination number of G and is denoted by γ ( G ) . A dominating set S such that the induced subgraph by S has at least one isolated vertex is called an isolate dominating set . An isolate dominating set of minimum cardinality is called the isolate domination number and is denoted by γ 0 ( G ) . We define the isolate bondage number of a graph G to be the cardinality of a smallest set E of edges for which γ 0 ( G - E ) > γ 0 ( G ) and is denoted by b 0 ( G ) . In this paper, we initiate a study on the isolate bondage number .
m-ETERNAL TOTAL BONDAGE NUMBER IN CIRCULANT GRAPHS
An Eternal dominating set of a graph is defined as a set of guards located at vertices, required to protect the vertices of the graph against infinitely long sequences of attacks, such that the configuration of guards induces a dominating set at all times. The eternal m-security number is defined as the minimum number of guards to handle an arbitrary sequence of single attacks using multiple-guard shifts. Klostermeyer and Myn-hardt defined the m-eternal total domination number of a graph G denoted by [gamma].sup.[infinity.sub.mt] (G) as the minimum number of guards to handle an arbitrary sequence of single attacks using multiple guard shifts and the configuration of guards always induces a total dominating set. We define the m-Eternal Total bondage number of a graph G denoted by [b.sub.mt](G) as the minimum cardinality of set of edges E' [??] E(G) for which [gamma].sup.[infinity.sub.mt](G - E') > [gamma].sup.[infinity.sub.mt](G) and G - E' does not contain isolated vertices. In this paper we find the exact values of [b.sub.mt](G) for Circulant graphs [C.sub.n](1, 2) and [C.sub.n](1, 3). Keywords: Eternal total domination, total domination, Bondage Number, m- Eternal total Bondage Number AMS Subject Classification: 83-02, 99A00
Human Trafficking and Contemporary Slavery
The article begins with a discussion of definitional issues regarding human trafficking and modern slavery and then briefly critiques some popular claims regarding each problem. Examples of macro-level research are critically evaluated, followed by a review of micro-level studies that illustrate tremendous variation and complexity in structural arrangements and individuals' lived experiences. These studies suggest that in this field micro-level research has at least three advantages over grand, macro-level meta-analyses-advantages that are quantitative (i.e., estimating the magnitude of the problem within a measurable universe), qualitative (i.e., documenting complexities in lived experiences), and well suited to formulating contextually appropriate policy and enforcement responses.
Graph Theory Approach to the Vulnerability of Transportation Networks
Nowadays, transport is the basis for the functioning of national, continental, and global economies. Thus, many governments recognize it as a critical element in ensuring the daily existence of societies in their countries. Those responsible for the proper operation of the transport sector must have the right tools to model, analyze, and optimize its elements. One of the most critical problems is the need to prevent bottlenecks in transport networks. Thus, the main aim of the article was to define the parameters characterizing the transportation network vulnerability and select algorithms to support their search. The parameters proposed are based on characteristics related to domination in graph theory. The domination, edge-domination concepts, and related topics, such as bondage-connected and weighted bondage-connected numbers, were applied as the tools for searching and identifying the bottlenecks in transportation networks. Furthermore, the algorithms for finding the minimal dominating set and minimal (maximal) weighted dominating sets are proposed. This way, the exemplary academic transportation network was analyzed in two cases: stationary and dynamic. Some conclusions are presented. The main one is the fact that the methods given in this article are universal and applicable to both small and large-scale networks. Moreover, the approach can support the dynamic analysis of bottlenecks in transport networks.
When Policy Meets Reality: Obstacles to eliminating debt bondage from responsible recruitment
‘Employer Pays Principle’ (EPP) responsible recruitment policies of multinational enterprises (MNEs) aim to reduce risks of forced labour in supply chains by requiring all costs of labour recruitment to be borne by employers, not workers. Based on in-depth interviews with almost 4,000 foreign migrant workers in Japan, Malaysia, and Thailand conducted between 2020 and 2025, this paper investigates how effectively EPP policies were implemented across supply chains. Less than ten per cent of respondents experienced truly zero-fees recruitment. All others had to pay some or all of the costs of recruitment up front, with 14.6 per cent being indebted in the process, and only 12.2 per cent ever receiving reimbursement for some or all fees paid. When significant recruitment fees were discovered, most suppliers resisted reimbursing the full amount. Most MNEs were not willing to require the full amount be repaid to affected workers, nor share the reimbursement costs. The paper concludes by calling on MNEs to adopt more responsible contracting practices to make EPP recruitment possible by suppliers; share responsibility for reimbursing recruitment fees to impacted workers in their supply chains; and consider as not EPP-compliant suppliers employing workers who have paid recruitment fees, even if they reimburse them later.
Domination and bondage number for double vertex graphs of some graphs
If a network modeled by a graph, then there are various graph theoretical parameters used to express the vulnerability and stability of communication networks. One of them is the concept of bondage number based on domination. The dominating set of a graph is a vertex set in that every vertex which is not in the dominating set is adjacent to at least one vertex of the dominating set. The domination number is the minimal cardinality among all dominating sets. The bondage number of any graph is the minimal cardinality among all sets of edges whose removal from the graph results in a graph with domination number greater than the domination number of the preliminary graph. In this paper, we investigate the domination and bondage numbers for double vertex graphs of some certain graphs.