Academia.eduAcademia.edu

Outline

Title
Abstract
Introduction
Conclusion and Open Problems
References
All Topics
Mathematics
Applied Mathematics

The edge-forwarding index of orbital regular graphs

Profile image of Patrick SolePatrick Sole

1994, Discrete Mathematics

https://doi.org/10.1016/0012-365X(92)00528-Y
visibility

…

description

6 pages

link

1 file

Abstract

We define a graph as orbital regular if there is a subgroup of its automorphism group that acts regularly on the set of edges of the graph as well as on all its orbits of ordered pairs of distinct vertices of the graph. For these graphs there is an explicit formula for the edgeforwarding index, an important traffic parameter for routing in interconnection networks. Using the arithmetic properties of finite fields we construct infinite families of graphs with low edge-forwarding properties.

Related papers

On ( a , 1 ) -Vertex-Antimagic Edge Labeling of Regular Graphs
Andrea Semaničová-feňovčíková

Journal of Applied Mathematics, 2015

An(a,s)-vertex-antimagic edge labeling(or an(a,s)-VAElabeling, for short) ofGis a bijective mapping from the edge setE(G)of a graphGto the set of integers1,2,…,|E(G)|with the property that the vertex-weights form an arithmetic sequence starting fromaand having common differences, whereaandsare two positive integers, and the vertex-weight is the sum of the labels of all edges incident to the vertex. A graph is called(a,s)-antimagic if it admits an(a,s)-VAElabeling. In this paper, we investigate the existence of(a,1)-VAE labeling for disconnected 3-regular graphs. Also, we define and study a new concept(a,s)-vertex-antimagic edge deficiency, as an extension of(a,s)-VAE labeling, for measuring how close a graph is away from being an(a,s)-antimagic graph. Furthermore, the(a,1)-VAE deficiency of Hamiltonian regular graphs of even degree is completely determined. More open problems are mentioned in the concluding remarks.

View PDFchevron_right
On quadratic orbital networks
Oliver Knill

These are some informal remarks on quadratic orbital networks over finite fields Z p. We discuss connectivity, Euler characteristic, number of cliques, planarity, diameter and inductive dimension. We prove that for d = 1 generators, the Euler characteristic is always nonnegative and for d = 2 and large enough p the Euler characteristic is negative. While for d = 1, all networks are planar, we suspect that for d ≥ 2 and large enough p, all networks are non-planar. As a consequence on bounds for the number of complete subgraphs of a fixed dimension, the inductive dimension of all these networks goes 1 as p → ∞.

View PDFchevron_right
On highly regular digraphs
Oktay Olmez
View PDFchevron_right
On automorphisms of strongly regular graphs with parameters (640, 243, 66, 108)
Alexander Makhnev

Doklady Mathematics, 2011

View PDFchevron_right
Finite Transitive Permutation Groups and Finite Vertex-Transitive Graphs, C E Praeger with assistance of C H Li and A C Niemeyer
Cheryl Praeger

… ASI Series C …, 1997

View PDFchevron_right
On the edge-balance index sets of (p, p+ 1)-graphs
sin-min lee

2012

Let G be a simple graph with vertex set V (G) and edge set E(G), and let Z 2 = {0, 1}. Any edge labeling f induces a partial vertex labeling f + : V (G) → Z 2 assigning 0 or 1 to f + (v), v being an element of V (G), depending on whether there are more 0-edges or 1edges incident with v, and no label is given to f + (v) otherwise. For each i ∈ Z 2 , let v f (i) = |{v ∈ V (G) : f + (v) = i}| and let e f (i) = |{e ∈ E(G) : f (e) = i}|. An edge-labeling f of G is said to be edge friendly if {|e f (0) − e f (1)| ≤ 1. The edge-balance index set of the graph G is defined as EBI(G) = {|v f (0) − v f (1)| : f is edge-friendly.}. In this paper, we investigate and present results concerning the edge-balance index sets of (p, p + 1)-graphs.

View PDFchevron_right
Arithmetic-Geometric Indices of Some Class of Graph
Rachanna Kanabur

Let G be a molecular graph. The Arithmetic-Geometric (AG) indices of G are defined as AG(G)=∑ √ * ∈() where du (ordv) denote the degree of the vertex u (orv), respectively. In this paper the AG indices of Star

View PDFchevron_right
Some remarks on orbital digraphs for the finite primitive groups
Murat beşenk

2018

In this paper we concern with the relationship between the finite groups PSL(2, q), q>5 a prime, and orbital digraphs. And also we explain that for a generator elliptic element in permutation group, there is a hyperbolic circuit in suborbital graph

View PDFchevron_right
On automorphisms of distance-regular graphs with intersection array {56, 45, 1; 1, 9, 56}
Alexander Makhnev

Doklady Mathematics, 2010

View PDFchevron_right
On automorphisms of strongly regular graphs with parameters λ = 1, μ = 2
Alexander Makhnev

Discrete Mathematics and Applications, 2004

View PDFchevron_right

References (10)

  1. Cl] E. Bannai and T. Ito, Algebraic Combinatorics I: Association Schemes (Benjamin/Cummings, Menlo Park, CA, 1984).
  2. N. Biggs, Algebraic Graph Theory (Cambridge University Press, Cambridge, 1974).
  3. B. Bollobas, Random Graphs (Academic Press, New York, 1985).
  4. M.M. Dodson, Homogeneous additive congruences, Philos. Trans. Roy. Sot. London Ser. A 261 (1967) 163-210.
  5. M.M. Dodson and A. Tietavlinen, A note on Waring's problem in GF(p), Acta Arith. 30 (1976) 159-167.
  6. J.L. Dornstetter, Some quasi perfect cyclic codes, AAECC-2, Lecture Notes in Comput. Sci. 228 (Springer, Berlin, 1984).
  7. T. Helleseth, On the covering radius of cyclic linear codes and arithmetic codes, Discrete Appl. Math. 11 (1985) 157-173.
  8. M.C. Heydemann, J. C. Meyer and D. Sotteau, On forwarding indices of networks, Discrete Appl. Math. 23 (1989) 103-123.
  9. F.J. MacWilliams and N.J.A. Sloane, The Theory of Error-correcting Codes (North-Holland, Amsterdam, 1981).
  10. P. Sole, Explicit constructions of interconnection networks with low forwarding index, in preparation.

Related papers

On orbital regular graphs and Frobenius graphs
Cheryl Praeger

1998

A graph is called a Frobenius graph if it is a connected orbital graph of a Frobenius group. In this paper, we show first that almost all orbital regular graphs are Frobenius graphs. Then we give a description of Frobenius graphs in terms of a family of (usually smaller) Frobenius graphs which are Cayley graphs for elementary abelian groups. Finally, based on this description, we obtain a formula for calculating the edge-forwarding index of Frobenius graphs.

View PDFchevron_right
Orbits on vertices and edges of finite graphs
Dominique Buset

Discrete Mathematics, 1985

Given two integers v > 0 and e/> 0, we prove that there exists a finite graph (resp. a finite connected graph) whose automorphism group has exactly v orbits on the set of vertices and e orbits on the set of edges if and only if v ~< 2e + 1 (resp. v ~< e + 1).

View PDFchevron_right
A Family Of Tetravalent One-Regular Graphs
Mohsen Ghasemi

Ars Comb., 2017

A graph is one-regular if its automorphism group acts regularly on the set of its arcs. In this paper, 4-valent one-regular graphs of order 5p, where p is a prime, are classified.

View PDFchevron_right
On edge-balance index sets of regular graphs
Sin-Min Lee

In a bi-racial country, it is desired that the num-bers of government ministers from the two races should differ by at most one for fairness. More-over, the numbers of pairs of ministries which in-teract directly with each other and both headed by ministers of one race should differ by at most one from that of the other race. One can naturally model the above social phenomenon by a graph la-beling which is called edge-balanced, which assigns edges approximately half 0&#39;s, and the other half 1&#39;s. And then the labeling requires that the in-duced vertex labels are also 0&#39;s over approximately one half vertices, and 1&#39;s over the other one half vertices. We generalize the concept of edge-balanced labeling to the concept of edge-balance index sets of graphs. In this article, properties regarding the edge-balance index sets of regular graphs are in-vestigated. In particular, we completely determine the edge-balance index sets of all 2-regular graphs, Möbius ladders (as exampl...

View PDFchevron_right
Finite edge-transitive oriented graphs of valency four: a global approach
Jehan Al-Bar

We develop a new framework for analysing finite connected, oriented graphs of valency 4, which admit a vertex-transitive and edge-transitive group of automorphisms preserving the edge orientation. We identify a sub-family of &quot;basic&quot; graphs such that each graph of this type is a normal cover of at least one basic graph. The basic graphs either admit an edge-transitive group of automorphisms that is quasiprimitive or biquasiprimitive on vertices, or admit an (oriented or unoriented) cycle as a normal quotient. We anticipate that each of these additional properties will facilitate effective further analysis, and we demonstrate that this is so for the quasiprimitive basic graphs. Here we obtain strong restirictions on the group involved, and construct several infinite families of such graphs which, to our knowledge, are different from any recorded in the literature so far. Several open problems are posed in the paper.

View PDFchevron_right

Related topics

  • Applied Mathematics
  • Pure Mathematics

    • Cited by

    FROBENIUS CIRCULANT GRAPHS OF VALENCY FOUR
    Sanming Zhou

    Journal of the Australian Mathematical Society, 2008

    Dedicated to Cheryl E. Praeger with love and best wishes on the occasion of her 60th birthday.

    View PDFchevron_right
    580 California St., Suite 400
    San Francisco, CA, 94104
    © 2025 Academia. All rights reserved