Results 121 to 130 of about 1,605,758 (310)
Sharp Lower Bound for Randić index of Trees with Fixed Roman Domination Number
Ars Comb.Let be a simple connected graph with vertex set and edge set . The Randić index of graph is the value , where and refer to the degree of the vertices and .
F. Movahedi, M. Akhbari, R. Hasni
semanticscholar +1 more source
Clinical Anatomy, EarlyView.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
Complexity and exact values for []-Roman and strong Roman domination for specific graph families
Motivated by the original idea of defending the Roman Empire, all these domination concepts can be interpreted as vertex-labeling schemes that model the allocation of resources to protect a graph against attacks.
Álvarez Ruiz, María del Pilar +3 more
core +1 more source
Comparative Analysis Of Roman And Inverse Roman Domination Numbers Across Graph Families.
Educational Administration: Theory and PracticeThis research paper delves into the intriguing realm of Roman domination and its inverse counterpart within various graph structures. Initially defining Roman domination as a graph theory concept where vertices are covered by distinct dominating sets ...
J. J. Raji, S. Meenakshi
semanticscholar +1 more source
Guided Toward Equity: Communities of Practice and Organizational Change in Community Colleges
New Directions for Community Colleges, EarlyView.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
Signed total double Roman dominating functions in graphs
AKCE International Journal of Graphs and CombinatoricsA signed total double Roman dominating function (STDRDF) on an isolated-free graph [Formula: see text] is a function [Formula: see text] such that (i) every vertex v with [Formula: see text] has at least two neighbors assigned 2 under f or one neighbor w
L. Shahbazi +2 more
doaj +1 more source
Carbon Energy, EarlyView.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
On maximal Roman domination in graphs: complexity and algorithms
RAIRO Oper. Res.For a simple undirected connected graph G = (V,E), a maximal Roman dominating function (MRDF) of G is a function f : V (G) → {0,1,2} with the following properties: (i) For every vertex v ∈ {v ∈ V |f(v) = 0}, there exists a vertex u ∈ N(v) such that f(u) =
Ze-Hui Shao +4 more
semanticscholar +1 more source
Total roman domination in digraphs
, 2021 Let D be a nite and simple digraph with vertex set V (D). A Roman dominating function (RDF) on a digraph D is a function f : V (D) → {0; 1; 2} satisfying the condition that every vertex v with f(v) = 0 has an in-neighbor u with f(u) = 2. The weight of an
Zhuang, Wei, Hu, Kangxiu, Hao, Guoliang
core
Chemie Ingenieur Technik, EarlyView.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