Results 121 to 130 of about 3,577 (286)
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
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
On $H$-antimagicness of Cartesian product of graphs
TURKISH JOURNAL OF MATHEMATICS, 2018 Summary: A graph \(G=(V(G),E(G))\) admits an \(H\)-covering if every edge in \(E\) belongs to a subgraph of \(G\) isomorphic to \(H\). A graph \(G\) admitting an \(H\)-covering is called \((a,d)\)-\(H\)-antimagic if there is a bijection \(f:V(G)\cup E(G) \to \{1,2,\dots, |V(G)|+|E(G)| \}\) such that, for all subgraphs \(H^\prime\) of \(G\) isomorphic ...
Bača, Martin +3 more
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
Vertex and edge PI indices of Cartesian product graphs
, 2007 The Padmakar–Ivan (PI) index of a graph G is the sum over all edges uv of G of the number of edges which are not equidistant from u and v. In this paper, the notion of vertex PI index of a graph is introduced.
M.H. Khalifeh +5 more
core +1 more source
Journal of Magnetic Resonance Imaging, EarlyView.ABSTRACT Background The demand for cardiac MRI is increasing with the growing burden of cardiovascular disease. However, conventional protocols require sequential acquisitions for multi‐breath‐hold 2D cine and 3D MR angiography (MRA), which is time‐consuming.
Ruixin Chen +7 more
wiley +1 more source
Uniform emulations of Cartesian-product and Cayley graphs
, 2002 In this paper, we consider graphs modeling interconnection networks of parallel systems and we deal with network simulations. More specifically, we focus on simulations involving Cartesian-product graphs and some subclasses of Cayley graphs.We study ...
Barth, D. +5 more
core +1 more source
Strategic Change, EarlyView.ABSTRACT The relationship between team composition and organizational outcomes is a critical topic in many managerial and business contexts. In this study, we utilize an experimental research method to examine the impact of cognitive diversity on team dynamics.
Jantunen Ari +5 more
wiley +1 more source
On perfect codes in Cartesian products of graphs
European Journal of Combinatorics, 2011 Assuming the existence of a partition in perfect codes of the vertex set of a finite or infinite bipartite graph $G$ we give the construction of a perfect code in the Cartesian product $ G \Box G \Box P_2$. Such a partition is easily obtained in the case of perfect codes in Abelian Cayley graphs and we give some example of applications of this result ...
openaire +2 more sources
A Note on Sobolev‐Lorentz Capacity and Hausdorff Measure
Mathematische Nachrichten, EarlyView.ABSTRACT In this paper, we give an elementary proof that sets of zero p,1$p,1$‐Sobolev‐Lorentz capacity are Hn−p$\mathcal {H}^{n-p}$‐null sets, independently of nonlinear potential theory. We further show that there exists a set of Sobolev‐Lorentz‐(p,1)$(p,1)$ capacity equal to zero with Hausdorff dimension equal n−p$n-p$.
Daniel Campbell
wiley +1 more source