University Library
  • Login
A gateway to Melbourne's research publications
Minerva Access is the University's Institutional Repository. It aims to collect, preserve, and showcase the intellectual output of staff and students of the University of Melbourne for a global audience.
View Item 
  • Minerva Access
  • Science
  • School of Mathematics and Statistics
  • School of Mathematics and Statistics - Research Publications
  • View Item
  • Minerva Access
  • Science
  • School of Mathematics and Statistics
  • School of Mathematics and Statistics - Research Publications
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

    FROBENIUS CIRCULANT GRAPHS OF VALENCY FOUR

    Thumbnail
    Download
    Frobenius circulant graphs of valency four (284.3Kb)

    Citations
    Scopus
    Web of Science
    Altmetric
    17
    14
    Author
    Thomson, A; Zhou, S
    Date
    2008-10-01
    Source Title
    Journal of the Australian Mathematical Society
    Publisher
    CAMBRIDGE UNIV PRESS
    University of Melbourne Author/s
    Zhou, Sanming; THOMSON, ALISON
    Affiliation
    Department of Mathematics and Statistics
    Metadata
    Show full item record
    Document Type
    Journal Article
    Citations
    Thomson, A. & Zhou, S. (2008). FROBENIUS CIRCULANT GRAPHS OF VALENCY FOUR. JOURNAL OF THE AUSTRALIAN MATHEMATICAL SOCIETY, 85 (2), pp.269-282. https://doi.org/10.1017/S1446788708000979.
    Access Status
    Open Access
    URI
    http://hdl.handle.net/11343/33003
    DOI
    10.1017/S1446788708000979
    Description

    © 2008 Australian Mathematical Society. Online edition of the journal is available at http://journals.cambridge.org/JAZ

    Abstract
    <jats:title>Abstract</jats:title><jats:p>A first kind Frobenius graph is a Cayley graph Cay(<jats:italic>K</jats:italic>,<jats:italic>S</jats:italic>) on the Frobenius kernel of a Frobenius group <jats:inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" mime-subtype="gif" mimetype="image" xlink:type="simple" xlink:href="S1446788708000979_inline1"><jats:alt-text>$K \rtimes H$</jats:alt-text></jats:inline-graphic> such that <jats:italic>S</jats:italic>=<jats:italic>a</jats:italic><jats:sup><jats:italic>H</jats:italic></jats:sup> for some <jats:italic>a</jats:italic>∈<jats:italic>K</jats:italic> with 〈<jats:italic>a</jats:italic><jats:sup><jats:italic>H</jats:italic></jats:sup>〉=<jats:italic>K</jats:italic>, where <jats:italic>H</jats:italic> is of even order or <jats:italic>a</jats:italic> is an involution. It is known that such graphs admit ‘perfect’ routing and gossiping schemes. A circulant graph is a Cayley graph on a cyclic group of order at least three. Since circulant graphs are widely used as models for interconnection networks, it is thus highly desirable to characterize those which are Frobenius of the first kind. In this paper we first give such a characterization for connected 4-valent circulant graphs, and then describe optimal routing and gossiping schemes for those which are first kind Frobenius graphs. Examples of such graphs include the 4-valent circulant graph with a given diameter and maximum possible order.</jats:p>
    Keywords
    Cayley graph; circulant graph; multi-loop network; double-loop network; Frobenius group; Frobenius graph; complete rotation; gossiping; minimum gossip time; routing; edgeforwarding; index; arc-forwarding index

    Export Reference in RIS Format     

    Endnote

    • Click on "Export Reference in RIS Format" and choose "open with... Endnote".

    Refworks

    • Click on "Export Reference in RIS Format". Login to Refworks, go to References => Import References


    Collections
    • Minerva Elements Records [53039]
    • School of Mathematics and Statistics - Research Publications [842]
    Minerva AccessDepositing Your Work (for University of Melbourne Staff and Students)NewsFAQs

    BrowseCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects
    My AccountLoginRegister
    StatisticsMost Popular ItemsStatistics by CountryMost Popular Authors