Results 221 to 230 of about 59,909 (247)

Panconnectivity of Cartesian product graphs

The Journal of Supercomputing, 2009
A graph G of order n (?2) is said to be panconnected if for each pair (x,y) of vertices of G there exists an xy-path of length ? for each ? such that d G (x,y)???n?1, where d G (x,y) denotes the length of a shortest xy-path in G. In this paper, we consider the panconnectivity of Cartesian product graphs.
You Lu, Jun-Ming Xu
openaire   +1 more source

Semi-cartesian product of graphs

Journal of Mathematical Chemistry, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

On Cartesian Product of Factor-Critical Graphs

Graphs and Combinatorics, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wu, Zefang, Yang, Xu, Yu, Qinglin
openaire   +1 more source

Embedding Cartesian Products of Graphs into de Bruijn Graphs

Journal of Parallel and Distributed Computing, 1997
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Andreae, Thomas, Nölle, Michael, Schreiber, Gerald   +2 more
openaire   +2 more sources

Cartesian products of block graphs

Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg, 1995
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Boundary Vertices of Cartesian Product of Directed Graphs

International Journal of Applied and Computational Mathematics, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Changat, Manoj, Narasimha-Shenoi, Prasanth G., Thottungal Joseph, Mary Shalet, Kumar, Ram   +3 more
openaire   +2 more sources

Fault diameter of Cartesian product graphs

Information Processing Letters, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xu, Min, Xu, Jun-Ming, Hou, Xin-Min
openaire   +1 more source

The Maximum Genus of Cartesian Products of Graphs

Canadian Journal of Mathematics, 1974
The maximum genus γM(G) of a connected graph G has been defined in [2] as the maximum g for which there exists an embedding h : G —> S(g), where S(g) is a compact orientable 2-manifold of genus g, such that each one of the connected components of S(g) — h(G) is homeomorphic to an open disk; such an embedding is called cellular.
openaire   +1 more source

Genus of cartesian products of regular bipartite graphs

Journal of Graph Theory, 1980
AbstractLet G(n, d) denote a connected regular bipartite graph on 2n vertices and of degree d. It is proved that any Cartesian product G(n, d) × G1(n1, d1) × G2(n2, d2) × ⃛ × Gm(nm, dm), such that max {d1, d2,…, dm} ≤ d ≤ d1 + d2 + ⃛ + dm, has a quadrilateral embedding, thereby establishing its genus, and thereby generalizing a result of White. It is
openaire   +1 more source

1‐Factorizations of cartesian products of regular graphs

Journal of Graph Theory, 1979
AbstractLet G1, G2…, Gn be regular graphs and H be the Cartesian product of these graphs (H = G1 × G2 × … × Gn). The following will be proved: If the set {G1, G2…, Gn} has at leat one of the following properties: (*) for at leat one i ϵ {1, 2,…, n}, there exists a 1‐factorization of Gi or (**) there exists at least two numbers i and j such that 1 ≤ i ...
openaire   +1 more source