scientific article; zbMATH DE number 637342
From MaRDI portal
Publication:4304398
cycle structurecyclesdecompositionembeddingHamiltonian cyclehypercubemeshparallel computationstar graphtorus
Planar graphs; geometric and topological aspects of graph theory (05C10) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Recommendations
Cited in
(17)- Decomposing a star graph into disjoint cycles
- Embedding meshes on the star graph
- Optimal data exchange algorithms on star graphs
- Some topological properties of star connected cycles
- On graphs whose star complement for \(-2\) is a path or a cycle
- Greedy cycles in the star graphs
- Block-cyclic matrix triangulation on the Cartesian product of star graphs
- Scheduling of independent jobs in star graph networks
- Cycle embedding in star graphs with edge faults
- Star polynomials of some families of graphs with small cyclomatic numbers
- Decomposition of star network S₅ into Hamilton cycles
- Cyclic Vertex Connectivity of Star Graphs
- scientific article; zbMATH DE number 1507243 (Why is no real title available?)
- On Some Structural Properties of Star and Pancake Graphs
- scientific article; zbMATH DE number 2187684 (Why is no real title available?)
- On cyclic-vertex connectivity of (n, k)-star graphs
- Minimum rank and path cover number for generalized and double generalized cycle star graphs
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 Q4304398)
