Results 91 to 100 of about 9,767,318 (248)
Perfect Roman and Perfect Italian Domination of Cartesian Product Graphs
For a graph G=(V,E), a function f:V→{0,1,2} is a perfect Roman dominating function (PRDF) on G if every v∈V with f(v)=0 is adjacent to exactly one vertex u with f(u)=2. The sum ∑_(v∈V)^▒f (v) is the weight w(f) of f.
Ahlam Almulhim
doaj +1 more source
Graphs with large Roman domination number
A Roman dominating function (RDF) on a graph tt = (V, E) is a function f : V (tt) 0, 1, 2 satisfying the condition that every vertex with label 0 is adjacent to a vertex with label 2. The weight of an RDF f is w(f ) = v V f (v).
Jawatankuasa Kerja PSM UPM
core
The Age of Questions: Truth Regimes and Subjectivity in the Era of Large Language Models
ABSTRACT This essay explores how digital technologies shape subjectivity's infra‐political constitution, focusing on large language models (LLMs) like ChatGPT or Gemini within what philosophers, inspired by Michel Foucault, term the “digital truth regime.” After defining this regime, the essay identifies five key traits of LLMs: presentism in truth ...
Charles Corval
wiley +1 more source
ABSTRACT A novel anatomical description and radiological finding, related to the anatomical course of the terminal fibular artery (FibA) was recently reported. In the article, the authors found the terminal FibA to change its course, from being posterior and medial to the fibula to surface anteriorly and laterally before residing below the tibiofibular
Sebastian Kirdar‐Smith +5 more
wiley +1 more source
Guided Toward Equity: Communities of Practice and Organizational Change in Community Colleges
ABSTRACT Although community colleges advance equity by providing opportunities for marginalized students to pursue higher education, barriers to earning credentials remain, particularly for students of color. Higher education stakeholders are investing in “equity work” as organizations take responsibility for ensuring equitable outcomes.
Karin Yndestad +2 more
wiley +1 more source
A Roman dominating function of a graph G is a function f : V (G) → {0, 1, 2} such that whenever f(v) = 0 there xists a vertex u adjacent to v such that f(u) = 2. The weight of f is w(f) = Pv∈V (G) f(v).
劉俊宏, Liu, Chun-Hung
core
Total Roman Domination of Kneser Graphs
The total Roman domination number of a graph is the smallest possible sum of the weights 0, 1, and 2 applied to vertices of the graph that satisfy certain rules originating from Roman military strategy.
Stainsby, Cole +6 more
core
This review outlines advanced modification strategies for electrocatalytic and photocatalytic H2O2 production, covering bandgap tuning, defect engineering, heterostructure construction, cocatalyst loading, and functional framework design. Structure‐performance correlations are revealed across catalysts such as metal oxides, sulfides, carbon nitrides ...
Na Li +9 more
wiley +1 more source
Roman edge domination in graphs
In this paper, we initiate a study on roman edge dominating function and roman edge domination number and its exact values for some standard graphs have been established.
Soner, N.D. +4 more
core
Thermal defrosting limits desublimator efficiency in freeze‐drying. This review and case study compares thermal versus mechanical regeneration, links frost properties and external heat transfer to energy demand, and summarizes pilot‐scale scraping results enabling single‐unit, continuous lyophilization.
Moritz Krummenacher +3 more
wiley +1 more source

