Results 111 to 120 of about 3,577 (286)
Energy Science &Engineering, EarlyView.The Radial Force (RF) distribution under different cutting angles is presented in Figure 1. Generally, the distribution of RF displays divergence across different flow conditions. The pattern of force distribution reveals a total of 24 peaks, which corresponds to the number of blades of the impeller of the SCP.
Kofi Asamoah Adu‐Poku +3 more
wiley +1 more source
Clique Minors in Cartesian Products of Graphs
CoRR, 2007 A "clique minor" in a graph G can be thought of as a set of connected subgraphs in G that are pairwise disjoint and pairwise adjacent. The "Hadwiger number" h(G) is the maximum cardinality of a clique minor in G. This paper studies clique minors in the Cartesian product G*H.
openaire +3 more sources
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
Green Human Resource Management and ISO 14001: Toward Environmental Sustainability in Organizations
Human Resource Development Quarterly, EarlyView.ABSTRACT The current climate change scenario imposes urgent challenges to different economic sectors around the world, requiring companies to adopt new strategies to achieve sustainable development goals (SDGs) while enhancing environmental awareness.
Eduardo Ortega +2 more
wiley +1 more source
The development of cartesian product operation of product fuzzy graphs and its properties
The product fuzzy graph is an extension of the fuzzy graph definition by replacing the minimum operation with the product operation. This research is qualitative research with research stages consisting of determining open problems, constructing new ...
Firmansah, Fery +2 more
core +1 more source
Total $k$-domination in Cartesian product of complete graphs
, 2022 Let $G=(V,E)$ be a finite undirected graph. A set $S$ of vertices in $V$ is said to be total $k$-dominating if every vertex in $V$ is adjacent to at least $k$ vertices in $S$.
Wisby, Justin, Carballosa, Walter
core
Signed Projective Cubes, a Homomorphism Point of View
Journal of Graph Theory, EarlyView.ABSTRACT The (signed) projective cubes, as a special class of graphs closely related to the hypercubes, are on the crossroad of geometry, algebra, discrete mathematics and linear algebra. Defined as Cayley graphs on binary groups, they represent basic linear dependencies.
Meirun Chen +2 more
wiley +1 more source
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
Fractional List Packing for Layered Graphs
Journal of Graph Theory, EarlyView.ABSTRACT The fractional list packing number χ ℓ • ( G ) ${\chi }_{\ell }^{\bullet }(G)$ of a graph G $G$ is a graph invariant that has recently arisen from the study of disjoint list‐colourings. It measures how large the lists of a list‐assignment L : V ( G ) → 2 N $L:V(G)\to {2}^{{\mathbb{N}}}$ need to be to ensure the existence of a “perfectly ...
Stijn Cambie, Wouter Cames van Batenburg
wiley +1 more source