Distinct paths for the star graph
In this paper, we investigate the properties of cycles for node representation in the star graph. Cycles can be in any order. The position for each symbol in the ordinary cycle is fixed and the ordinary cycle can not be nested into any other cycle. However, cyclic shift operations on symbols in a none-ordinary cycle are allowed and none-ordinary cycle can be nested into any other cycle. The number of distinct paths for the star graph is determined using the combinatorial analysis.
Computer architecture; Computer science; Fault tolerance; Hypercubes; Measurement; Mobile communication; Mobile computing; Performance analysis; Topology; Tree graphs
Controls and Control Theory | Electrical and Computer Engineering | Electrical and Electronics | Systems and Communications
Use Find in Your Library, contact the author, or interlibrary loan to garner a copy of the item. Publisher policy does not allow archiving the final published version. If a post-print (author's peer-reviewed manuscript) is allowed and available, or publisher policy changes, the item will be deposited.
Distinct paths for the star graph.
WRI International Conference on Communications and Mobile Computing, CMC
Institute of Electrical and Electronics Engineers.