4-cycle properties for characterizing rectagraphs and hypercubes

Title:

4-cycle properties for characterizing rectagraphs and hypercubes

Creator:

Bouanane, Khadra and Berrachedi, Abdelhafid

Identifier:

https://cdk.lib.cas.cz/client/handle/uuid:53231f76-1fbd-42db-9e42-19c157cf74ed
uuid:53231f76-1fbd-42db-9e42-19c157cf74ed
issn:0011-4642

Subject:

matematika, mathematics, charakterizace, hypercube, (0, 2)-graph, rectagraph, 4-cycle, characterization, 13, and 51

Type:

model:article and TEXT

Format:

print, bez média, and svazek

Description:

A (0, 2)-graph is a connected graph, where each pair of vertices has either 0 or 2 common neighbours. These graphs constitute a subclass of (0, λ)-graphs introduced by Mulder in 1979. A rectagraph, well known in diagram geometry, is a triangle-free (0, 2)-graph. (0, 2)-graphs include hypercubes, folded cube graphs and some particular graphs such as icosahedral graph, Shrikhande graph, Klein graph, Gewirtz graph, etc. In this paper, we give some local properties of 4-cycles in (0, λ)-graphs and more specifically in (0, 2)-graphs, leading to new characterizations of rectagraphs and hypercubes., Khadra Bouanane, Abdelhafid Berrachedi., and Obsahuje bibliografii

Language:

English

Rights:

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

Coverage:

29-36

Source:

Czechoslovak Mathematical Journal | 2017 Volume:67 | Number:1

Harvested from:

CDK

Metadata only:

false