Results 111 to 120 of about 3,558 (256)
Integer domination of Cartesian product graphs
Discrete Mathematics, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Keerti Choudhary +2 more
openaire +1 more source
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
Transit functions on graphs (and posets) [PDF]
The notion of transit function is introduced to present a unifying approachfor results and ideas on intervals, convexities and betweenness in graphs andposets.
Mulder, H.M.
core +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 +2 more sources
Stable Cuts, NAC‐Colourings and Flexible Realisations of Graphs
Journal of Graph Theory, EarlyView.ABSTRACT A (2‐dimensional) realisation of a graph G $G$ is a pair ( G , p ) $(G,p)$, where p $p$ maps the vertices of G $G$ to R 2 ${{\mathbb{R}}}^{2}$. A realisation is flexible if it can be continuously deformed while keeping the edge lengths fixed, and rigid otherwise.
Katie Clinch +5 more
wiley +1 more source
International Journal of Analysis and Applications, 2018 We introduce certain concepts, including cubic graphs, internal cubic graphs, external cubic graphs, and illustrate these concepts by examples. We deal with fundamental operations, Cartesian product, composition, union and join of cubic graphs.
Sheikh Rashid +3 more
doaj +2 more sources
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
Magnetic Resonance in Medicine, EarlyView.ABSTRACT Purpose Magnetic Resonance Fingerprinting (MRF) enables rapid quantitative imaging, but high‐resolution 3D reconstructions remain computationally expensive due to the NUFFTs required at every iteration, and the commonly used Locally Low Rank (LLR) regularization becomes ineffective at high acceleration.
Yonatan Urman +4 more
wiley +1 more source
The genus of the Cartesian product of two graphs [PDF]
, 1971 Upper and lower bounds are given for the genus, γ(G1 × G2), of the Cartesian product of arbitrary graphs G1 and G2, in terms of the genera γ(G1) and γ(G2).
White, Arthur T
core +1 more source