Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
SpringerLink
Log in

A Note on Adjacency-Transitivity of a Graph and Its Complement

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract.

We give a necessary and sufficient condition for a graphical regular representation to be adjacency-transitive, and provide an infinite family of finite simple undirected vertex-transitive graphs Γ, such that neither Γ nor Γc is adjacency-transitive.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Pedagoška fakulteta, Univerza v Ljubljani, Kardeljeva ploščad 16, SI-1113 Ljubljana, Slovenija. e-mail: boris.zgrablic@uni-lj.si, , , , , , SI

    Boris Zgrablić

Authors
  1. Boris Zgrablić
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Revised: March 24, 1998

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zgrablić, B. A Note on Adjacency-Transitivity of a Graph and Its Complement. Graphs Comb 16, 463–465 (2000). https://doi.org/10.1007/PL00007231

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/PL00007231

Keywords

Search

Navigation