Results 31 to 40 of about 2,865,652 (295)
On the Crossing Numbers of Cartesian Products of Stars and Graphs of Order Six
Discussiones Mathematicae Graph Theory, 2013 The crossing number cr(G) of a graph G is the minimal number of crossings over all drawings of G in the plane. According to their special structure, the class of Cartesian products of two graphs is one of few graph classes for which some exact values of ...
Klešč Marián, Schrötter Štefan
doaj +1 more source
Oriented Chromatic Number of Cartesian Products Pm □ Pn and Cm □ Pn
Discussiones Mathematicae Graph Theory, 2022 We consider oriented chromatic number of Cartesian products of two paths Pm □ Pn and of Cartesian products of paths and cycles, Cm □ Pn. We say that the oriented graph G→\vec G is colored by an oriented graph H→\vec H if there is a homomorphism from G ...
Nenca Anna
doaj +1 more source
Weak k-reconstruction of Cartesian products [PDF]
, 2003 By Ulam's conjecture every finite graph G can be reconstructed from its deck of vertex deleted subgraphs. The conjecture is still open, but many special cases have been settled. In particular, one can reconstruct Cartesian products.
Imrich, Wilfried +2 more
core +1 more source
On Cartesian Products of Orthogonal Double Covers
International Journal of Mathematics and Mathematical Sciences, 2013 Let H be a graph on n vertices and 𝒢 a collection of n subgraphs of H, one for each vertex, where 𝒢 is an orthogonal double cover (ODC) of H if every edge of H occurs in exactly two members of 𝒢 and any two members share an edge whenever the ...
R. El Shanawany, M. Higazy, A. El Mesady
doaj +1 more source
The metric dimension of circulant graphs and their Cartesian products [PDF]
Opuscula Mathematica, 2017 Let \(G=(V,E)\) be a connected graph (or hypergraph) and let \(d(x,y)\) denote the distance between vertices \(x,y\in V(G)\). A subset \(W\subseteq V(G)\) is called a resolving set for \(G\) if for every pair of distinct vertices \(x,y\in V(G)\), there ...
Kevin Chau, Shonda Gosselin
doaj +1 more source
Factorization of Cartesian Products of Hypergraphs [PDF]
, 2010 In this article we present the L2-section, a tool used to represent a hypergraph in terms of an "advanced graph" and results leading to first algorithm, in O(nm), for a bounded-rank, bounded-degree hypergraph H, which factorizes H in prime factors. The paper puts a premium on the characterization of the prime factors of a hypergraph, by exploiting ...
Alain Bretto, Yannick Silvestre
openaire +3 more sources
Oriented Chromatic Number of Cartesian Products and Strong Products of Paths
Discussiones Mathematicae Graph Theory, 2019 An oriented coloring of an oriented graph G is a homomorphism from G to H such that H is without selfloops and arcs in opposite directions. We shall say that H is a coloring graph.
Dybizbański Janusz, Nenca Anna
doaj +1 more source
Loosely Bernoulli Cartesian products [PDF]
Proceedings of the American Mathematical Society, 1979 For any totally ergodic loosely Bernoulli automorphism T , a class S (
openaire +1 more source
(Open) packing number of some graph products [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 The packing number of a graph $G$ is the maximum number of closed neighborhoods of vertices in $G$ with pairwise empty intersections. Similarly, the open packing number of $G$ is the maximum number of open neighborhoods in $G$ with pairwise empty ...
Doost Ali Mojdeh +3 more
doaj +1 more source
On Force in Cartesian Physics [PDF]
, 2007 There does not seem to be a consistent way to ground the concept of “force” in Cartesian first principles. In this paper, I examine various attempts at this. I argue that each attempt (as presented) carries with it unavoidable problems that undermine its
Manchak, John Byron
core