scientific article; zbMATH DE number 1054728

zbMATH Open0885.05075MaRDI QIDQ4352273FDOQ4352273

Authors: Marie-Claude Heydemann 

Publication date: 6 October 1997

Title of this publication is not available (Why is that?)

Recommendations

• Cayley graphs
• Processor interconnection networks from Cayley graphs
• New methods for using Cayley graphs in interconnection networks
• Some mathematical properties of cayley digraphs with applications to interconnection network design
• Theory and Applications of Models of Computation

zbMATH Keywords

Cayley graphsinterconnection networksroutings

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Distance in graphs (05C12) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Paths and cycles (05C38)

Cited In (95)

• On the strictness of a bound for the diameter of Cayley graphs generated by transposition trees
• Low time complexity algorithms for path computation in Cayley graphs
• A FEW FAMILIES OF CAYLEY GRAPHS AND THEIR EFFICIENCY AS COMMUNICATION NETWORKS
• Super \(R^k\)-vertex-connectedness
• Eigenvalues of Cayley graphs
• Title not available (Why is that?)
• A survey on the Intersection graphs of ideals of rings
• Efficient eight-regular circulants based on the Kronecker product
• Automorphism groups of Cayley graphs generated by general transposition sets
• Graph constructions derived from interconnection networks
• Navigating directed Cayley graphs of small diameter: a potent Solovay-Kitaev procedure
• 3-path-connectivity of Cayley graphs generated by transposition trees
• Cubic core-free symmetric \(m\)-Cayley graphs
• A tight upper bound on the number of cyclically adjacent transpositions to sort a permutation
• SOME GRAPH PARAMETERS OF POWER SET GRAPHS
• A construction of a partial difference set in the extraspecial groups of order \(p^3\) with exponent \(p^2\)
• Extremal even-cycle-free subgraphs of the complete transposition graphs
• Cube-connected circulants: bisection width, Wiener and forwarding indices
• Resistance distance and Kirchhoff index in dihedral Cayley graphs
• Fault-Tolerant Maximal Local-Connectivity on Cayley Graphs Generated by Transpositions
• Conditional connectivity of bubble sort graphs
• Reliability assessment of the Cayley graph generated by trees
• Variational networks of cube-connected cycles are recursive cubes of rings
• Symmetric property and edge-disjoint Hamiltonian cycles of the spined cube
• Using semidirect products of groups to build classes of interconnection networks
• Concurrent flows and packet routing in Cayley graphs (Preliminary version)
• A kind of conditional connectivity of transposition networks generated by \(k\)-trees
• Symmetric property and reliability of locally twisted cubes
• On the energy of transposition graphs
• Sorting on graphs by adjacent swaps using permutation groups
• On the structure of the adjacency matrix of the line digraph of a regular digraph
• Forwarding and optical indices of 4-regular circulant networks
• On the pagenumber of trivalent Cayley graphs
• A family of efficient six-regular circulants representable as a Kronecker product
• Relationship between conditional diagnosability and 2-extra connectivity of symmetric graphs
• On symmetries of Cayley graphs and the graphs underlying regular maps
• Cycle Kronecker products that are representable as optimal circulants
• Fully symmetric swapped networks based on bipartite cluster connectivity
• The diameter of honeycomb rhombic tori.
• Symmetry properties of chordal rings of degree 3
• A kind of conditional connectivity of Cayley graphs generated by wheel graphs
• Routing in graphs
• On the identification problems in products of cycles
• The automorphism group of the alternating group graph
• Bipancyclic properties of Cayley graphs generated by transpositions
• Two families of Cayley graph interconnection networks
• A kind of conditional vertex connectivity of star graphs
• Cyclic group blocking polyhedra
• Gossiping and routing in second-kind Frobenius graphs
• A kind of conditional connectivity of Cayley graphs generated by unicyclic graphs
• The super-connectivity of Kneser graphs
• On the number of closed walks in vertex-transitive graphs
• Isomorphism conditions for Cayley graphs of rectangular groups
• Decompositions of complete graphs into circulants
• Hyper hamiltonian laceability of Cayley graphs generated by transpositions
• Trivalent Cayley graphs for interconnection networks
• Cayley graphs as classifiers for data mining: the influence of asymmetries
• Structural properties of Cayley digraphs with applications to mesh and pruned torus interconnection networks
• Title not available (Why is that?)
• Labelings in Cayley digraphs
• A Class of Arc-Transitive Cayley Graphs as Models for Interconnection Networks
• The generalized 3-connectivity of star graphs and bubble-sort graphs
• Deterministic walks with choice
• Rotational circulant graphs
• New methods for using Cayley graphs in interconnection networks
• Characterizations of Clifford semigroup digraphs
• On transitive Cayley graphs of groups and semigroups
• Dense bipartite circulants and their routing via rectangular twisted torus
• Further mathematical properties of Cayley digraphs applied to hexagonal and honeycomb meshes
• Edge-transitivity of Cayley graphs generated by transpositions
• Greedy cycles in the star graphs
• Frobenius circulant graphs of valency six, Eisenstein-Jacobi networks, and hexagonal meshes
• Tree connectivities of Cayley graphs on abelian groups with small degrees
• Thek-degree Cayley graph and its topological properties
• Counterexamples to the uniform shortest path routing conjecture for vertex-transitive graphs
• On the edge-forwarding indices of Frobenius graphs
• On polynomial digraphs
• On Cayley graphs of completely 0-simple semigroups
• Optimal identifying codes of two families of Cayley graphs
• The vertex-transitive TLF-planar graphs
• The generalized connectivity of bubble-sort star graphs
• Characteristic polynomials of digraphs having a semi-free action
• A channel assignment problem for optical networks modelled by Cayley graphs
• Cayley graphs
• Application of coding theory to interconnection networks
• Analysis on component connectivity of bubble-sort star graphs and burnt pancake graphs
• On transitive Cayley graphs of strong semilattices of right (left) groups
• Graph theory and interconnection networks.
• Cayley graphs as models of deterministic small-world networks
• On two generalized connectivities of graphs
• Echo: a peer-to-peer clustering framework for improving communication in DHTs
• Some mathematical properties of cayley digraphs with applications to interconnection network design
• Construction of Hamiltonian circuits in Cayley graphs modeling multiprocessing computer systems
• Constructing integral uniform flows in symmetric networks with application to the edge-forwarding index problem
• Theory and Applications of Models of Computation

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4352273)