On extendability of Cayley graphs | Zendy

Štefko Miklavič | Zendy; Primož Šparl | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

On extendability of Cayley graphs

Author(s) -

Štefko Miklavič,

Primož Šparl

Publication year - 2009

Publication title -

filomat

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.449

H-Index - 34

eISSN - 2406-0933

pISSN - 0354-5180

DOI - 10.2298/fil0903093m

Subject(s) - mathematics , cayley graph , combinatorics , dihedral group , vertex transitive graph , abelian group , vertex (graph theory) , graph , discrete mathematics , line graph , voltage graph , group (periodic table) , chemistry , organic chemistry

A connected graph i of even order is n-extendable, if it contains a matching of size n and if every such matching is contained in a perfect matching of i. Furthermore, a connected graph i of odd order is n 1 -extendable, if for every vertex v of i the graph i i v is n-extendable. It is proved that every connected Cayley graph of an abelian group of odd order which is not a cycle is 1 1 -extendable. This result is then used to classify 2-extendable connected Cayley graphs of generalized dihedral groups.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research