Path embedding in star graphs (Q1002273)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Path embedding in star graphs	scientific article

Statements

scholarly article

0 references

Path embedding in star graphs (English)

0 references

zbMATH Open document ID

0 references

10.1016/j.amc.2008.10.040

0 references

Ming-Chien Yang

0 references

Applied Mathematics and Computation

0 references

publication date

25 February 2009

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

zbMATH Keywords

path

0 references

embedding

0 references

star graph

0 references

interconnection network

0 references

Hamiltonian

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.amc.2008.10.040

0 references

0 references

A group-theoretic model for symmetric interconnection networks

0 references

Pancyclicity of recursive circulant graphs

0 references

Optimal fault-tolerant embedding of paths in twisted cubes

0 references

0 references

Longest fault-free paths in star graphs with vertex faults

0 references

Fault-free Hamiltonian cycles in crossed cubes with conditional link faults

0 references

Embedding binary trees into crossed cubes

0 references

On the fault-diameter of the star graph

0 references

Cycle embedding in star graphs with edge faults

0 references

Mutually independent hamiltonian paths in star networks

0 references

Paths in Möbius cubes and crossed cubes

0 references

Edge-bipancyclicity of star graphs under edge-fault tolerant

0 references

Hamiltonian circuit and linear array embeddings in faulty \(k\)-ary \(n\)-cubes

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1002273

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1002273&oldid=35094897"