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