Results 91 to 100 of about 2,463 (224)
Energy‐Flow Regimes and Their Temporal Transitions in a PV‐Building System
Energy Science &Engineering, EarlyView.Unlike production and consumption, which act as external factors, generated energy flows reflect the system's internal behavior regarding energy allocation at each time step. The combination of self‐consumption, surplus, and import of surplus energy into the power grid characterizes how electricity is routed between the building's local consumption and
Jacek Caban +3 more
wiley +1 more source
Hamilton decompositions of cartesian products of graphs
Discrete Mathematics, 1991 Jean-Claude Bermond conjectured in 1978 that, if two graphs are decomposable into Hamiltonian cycles, then so is their Cartesian product. In this paper the conjecture is verified in so many cases that a complete solution seems to be within reach. For example, the conjecture is true if both graphs are decomposable into at least three Hamiltonian cycles.
openaire +3 more sources
Monotone Chromatic Number of Graphs
International Journal of Analysis and Applications, 2020 For a graph G = (V, E), a vertex coloring (or, simply, a coloring) of G is a function C: V (G) → {1, 2, ..., k} (using the non-negative integers {1, 2, ..., k} as colors).
Anwar Saleh +3 more
doaj
The irregularity of graphs under graph operations
Discussiones Mathematicae Graph Theory, 2014 The irregularity of a simple undirected graph G was defined by Albertson [5] as irr(G) = ∑uv∈E(G) |dG(u) − dG(v)|, where dG(u) denotes the degree of a vertex u ∈ V (G).
Abdo Hosam, Dimitrov Darko
doaj +1 more source
A Class of Graphs Approaching Vizing's Conjecture
Theory and Applications of Graphs, 2016 For any graph G=(V,E), a subset S of V dominates G if all vertices are contained in the closed neighborhood of S, that is N[S]=V. The minimum cardinality over all such S is called the domination number, written γ(G). In 1963, V.G. Vizing conjectured that
Aziz Contractor, Elliot Krop
doaj +1 more source
International Journal for Numerical Methods in Fluids, EarlyView.This study systematically investigates the variability of cylinder flow results. We provide a comprehensive overview of literature values and, using the lattice Boltzmann method (LBM), show that insufficient convergence studies and variations in simulation parameters are a plausible cause for the significant spread in data.
Maximilian Bille +4 more
wiley +1 more source
Recognizing triangulated Cartesian graph products
Discrete Mathematics, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shehzad Afzal, Clemens Brand
openaire +2 more sources
Edge-Transitive Lexicographic and Cartesian Products
Discussiones Mathematicae Graph Theory, 2016 In this note connected, edge-transitive lexicographic and Cartesian products are characterized. For the lexicographic product G ◦ H of a connected graph G that is not complete by a graph H, we show that it is edge-transitive if and only if G is edge ...
Imrich Wilfried +3 more
doaj +1 more source
Magnetic Resonance in Medicine, EarlyView.ABSTRACT Purpose To develop and validate a repeatable and reproducible approach, QuantoRAGE, for simultaneous whole‐brain T1 and T2 mapping using adiabatic magnetization preparation. Methods QuantoRAGE is a 3D FLASH‐based sequence using an adiabatic T2‐prepared inversion followed by two readout blocks.
Natalia Pato Montemayor +21 more
wiley +1 more source
Fault‐Tolerant Mutual‐Visibility: Complexity and Solutions for Grid‐Like Networks
Networks, EarlyView.ABSTRACT Networks are often modeled using graphs, and within this setting we introduce the notion of k$$ k $$‐fault‐tolerant mutual visibility. Informally, a set of vertices X⊆V(G)$$ X\subseteq V(G) $$ in a graph G$$ G $$ is a k$$ k $$‐fault‐tolerant mutual‐visibility set (k$$ k $$‐ftmv set) if any two non‐adjacent vertices in X$$ X $$ are connected by
Serafino Cicerone +3 more
wiley +1 more source