Flows on the join of two graphs

Title:

Flows on the join of two graphs

Creator:

Lukoťka, Robert and Rollová, Edita

Identifier:

https://cdk.lib.cas.cz/client/handle/uuid:9eb57be8-95a9-4896-ae65-994befa37f65
uuid:9eb57be8-95a9-4896-ae65-994befa37f65
doi:10.21136/MB.2013.143511

Subject:

nowhere-zero flow and graph join

Type:

model:article and TEXT

Format:

bez média and svazek

Description:

The join of two graphs G and H is a graph formed from disjoint copies of G and H by connecting each vertex of G to each vertex of H. We determine the flow number of the resulting graph. More precisely, we prove that the join of two graphs admits a nowhere-zero 3-flow except for a few classes of graphs: a single vertex joined with a graph containing an isolated vertex or an odd circuit tree component, a single edge joined with a graph containing only isolated edges, a single edge plus an isolated vertex joined with a graph containing only isolated vertices, and two isolated vertices joined with exactly one isolated vertex plus some number of isolated edges.

Language:

English

Rights:

http://creativecommons.org/publicdomain/mark/1.0/
policy:public

Coverage:

383-396

Source:

Mathematica bohemica | 2013 Volume:138 | Number:4

Harvested from:

CDK

Metadata only:

false