Results 11 to 20 of about 180,167 (290)
Domination Number of Graphs with Minimum Degree Five
Discussiones Mathematicae Graph Theory, 2021 We prove that for every graph G on n vertices and with minimum degree five, the domination number γ(G) cannot exceed n/3. The proof combines an algorithmic approach and the discharging method.
Bujtás Csilla
doaj +2 more sources
Minimal counterexamples and discharging method [PDF]
, 2014 8 pages.
Wang, Tao
openaire +3 more sources
Multi-objective operation optimization method of microgrid considering the influence of electric vehicle [PDF]
Scientific ReportsIn view of the negative impact on the stable operation of the system caused by the disorderly charging of large-scale electric vehicles connected to the microgrid, an optimization method for the operation of microgrid considering the impact of electric ...
Tiefeng Xu +5 more
doaj +2 more sources
On the Double Roman Domination in Generalized Petersen Graphs P(5k,k)
Mathematics, 2022 A double Roman dominating function on a graph G=(V,E) is a function f:V→{0,1,2,3} satisfying the condition that every vertex u for which f(u)=0 is adjacent to at least one vertex assigned 3 or at least two vertices assigned 2, and every vertex u with f(u)
Darja Rupnik Poklukar, Janez Žerovnik
doaj +1 more source
Short-term Self-Scheduling of Virtual Energy Hub Plant within Thermal Energy Market [PDF]
, 2021 Multicarrier energy systems create new challenges as well as opportunities in future energy systems. One of these challenges is the interaction among multiple energy systems and energy hubs in different energy markets.
Jadidbonab, Mohammad +3 more
core +2 more sources
Neighbor Distinguishing Colorings of Graphs with the Restriction for Maximum Average Degree
Axioms, 2023 Neighbor distinguishing colorings of graphs represent powerful tools for solving the channel assignment problem in wireless communication networks. They consist of two forms of coloring: neighbor distinguishing edge coloring, and neighbor distinguishing ...
Jingjing Huo +3 more
doaj +1 more source
Equitable Coloring of IC-Planar Graphs with Girth g ≥ 7
Axioms, 2023 An equitable k-coloring of a graph G is a proper vertex coloring such that the size of any two color classes differ at most 1. If there is an equitable k-coloring of G, then the graph G is said to be equitably k-colorable.
Danjun Huang, Xianxi Wu
doaj +1 more source
Determination of Lithium-Ion Battery Capacity for Practical Applications
Batteries, 2023 Batteries are becoming highly important in automotive and power system applications. The lithium-ion battery, as the fastest growing energy storage technology today, has its specificities, and requires a good understanding of the operating ...
Hrvoje Bašić +2 more
doaj +1 more source
Energy Reports, 2022 When the low voltage ride-through(LVRT) method of combining rotor energy storage with a discharging resistance for a wind turbine with permanent magnet synchronous generator(PMSG) is adopted, with the traditional control strategy, there are the ...
Jian Wang +3 more
doaj +1 more source
Neighbor Sum Distinguishing Total Chromatic Number of Planar Graphs without 5-Cycles
Discussiones Mathematicae Graph Theory, 2020 For a given graph G = (V (G), E(G)), a proper total coloring ϕ: V (G) ∪ E(G) → {1, 2, . . . , k} is neighbor sum distinguishing if f(u) ≠ f(v) for each edge uv ∈ E(G), where f(v) = Σuv∈E(G) ϕ(uv)+ϕ(v), v ∈ V (G). The smallest integer k in such a coloring
Zhao Xue, Xu Chang-Qing
doaj +1 more source