Results 61 to 70 of about 15,570,600 (248)
On Roman, Global and Restrained Domination in Graphs [PDF]
In this paper, we present new upper bounds for the global domination and Roman domination numbers and also prove that these results are asymptotically best possible.
Zverovich, Vadim +3 more
core +1 more source
Replacing toxic NiOx with phenyl‐substituted phosphonic‐acid carbazole monolayers (Ph‐5PACz) yields inverted perovskite solar cells that are efficient and recyclable. The nickel‐free interface reaches 25.3% efficiency and enables closed‐loop ITO recovery with near‐98% performance retention, while life‐cycle and techno‐economic analyses confirm lower ...
Yanxue Wang +17 more
wiley +1 more source
The Number of Minimum Roman and Minimum Total Dominating Sets for Some Chessboard Graphs
In this paper, both the roman domination number and the number of minimum roman dominating sets are found for any rectangular rook’s graph. In a similar fashion, the roman domination number and the number of minimum roman dominating sets are found on the square bishop’s graph for odd board sizes.
openaire +2 more sources
Quasi-total Roman Domination in Graphs [PDF]
[EN] A quasi-total Roman dominating function on a graph G=(V,E) is a function f:V ->{0,1,2}satisfying the following: Every vertex for which u for which f(u) = 0 is adjacent to at least one vertex v for which f(v) = 2, and If x is an isolated vertex in ...
González Yero, Ismael +3 more
core +1 more source
The hydration behavior of C3S in seawater‐relevant solutions is studied based on experiments, boundary nucleation and growth (BNG) modeling, and machine learning. The main ions included in seawater modify hydration mechanisms, with MgCl2 showing the strongest acceleration effect at the same concentration.
Yanjie Sun +6 more
wiley +1 more source
The Signed Total Mixed Roman Domination Numbers of Graphs
Abstract The problem of signed domination of graphs is a typical optimization problem. It requires that each vertex and edge be assigned a feasible label so that the sum of assigned labels is minimized. First, we propose the concept of a signed total mixed Roman domination number and introduce the related research progress.
Xia Hong, Li Zhang, Xiaobing Guo
openaire +1 more source
Variants of the Domination Number for Flower Snarks [PDF]
We consider the flower snarks, a widely studied infinite family of 3--regular graphs. For the Flower snark $J_n$ on $4n$ vertices, it is trivial to show that the domination number of $J_n$ is equal to $n$. However, results are more difficult to determine
Burdett, Ryan +2 more
core
Domination parameters: Roman domination number
Tezin 1. bölümünde, baskınlık sayısı ve Roman baskınlık sayısı tanımları verilerek, bu kavramlar günlük yaşamdan örnekler ile açıklanmıştır. Ardından Roman baskınlık sayısı için literatürde yer alan bazı sonuçlar verilmiştir. Tezin 2.
Zaim, Nurdan
core
On the Roman Edge Domination Number of a Graph [PDF]
Let G be a simple graph with vertex set V (G) and edge set E(G)
K. Ebadi +5 more
core +1 more source
Abstract The cortical bone structure of long bone diaphyses changes throughout growth via skeletal modeling and has important implications for bone strength and structural integrity. Ontogenetic trends in diaphyseal structure have been identified in both chimpanzees and humans but it is not yet clear how these trends compare given notable differences ...
Karen R. Swan +3 more
wiley +1 more source

