A comparative study of topological properties of hypercubes and star graphs

1994 ◽  
Vol 5 (1) ◽  
pp. 31-38 ◽  
Author(s):  
K. Day ◽  
A. Tripathi
Keyword(s):  
Comparative Study ◽  
Topological Properties ◽  
Star Graphs

On normality of a closure space generated from a tree by relation

2021 ◽  
pp. 2250110
Author(s):  
A. K. Das ◽  
Ria Gupta
Keyword(s):  
Comparative Study ◽  
Binary Relation ◽  
Applied Mathematics ◽  
Closure Space ◽  
Topological Properties ◽  
Closure Spaces

Binary relation plays a prominent role in the study of mathematics in particular applied mathematics. Recently, some authors generated closure spaces through relation and made a comparative study of topological properties in the space by varying the property on the relation. In this paper, we have studied closure spaces generated from a tree through binary relation and observed that under certain situation the space generated from a tree is normal.

scholarly journals Topological properties of star graphs

1993 ◽  
Vol 25 (12) ◽  
pp. 87-98 ◽  
Author(s):  
Sumit Sur ◽  
Pradip K. Srimani
Keyword(s):  
Topological Properties ◽  
Star Graphs

scholarly journals Some topological properties of star graphs: The surface area and volume

2009 ◽  
Vol 309 (3) ◽  
pp. 560-569 ◽  
Author(s):  
Navid Imani ◽  
Hamid Sarbazi-Azad ◽  
Selim G. Akl
Keyword(s):  
Surface Area ◽  
Topological Properties ◽  
Star Graphs ◽  
Area And Volume

scholarly journals Design and Analysis of a Symmetric Log Star Graph with a Smaller Network Cost Than Star Graphs

Electronics ◽  
2021 ◽  
Vol 10 (8) ◽  
pp. 981
Author(s):  
Jung-Hyun Seo ◽  
Hyeong-Ok Lee
Keyword(s):  
Parallel Computing ◽  
Computer Science ◽  
Regular Graph ◽  
Connected Graph ◽  
Routing Algorithm ◽  
Star Graph ◽  
Topological Properties ◽  
Star Graphs ◽  
Network Cost ◽  
Network Costs

Graphs are used as models to solve problems in fields such as mathematics, computer science, physics, and chemistry. In particular, torus, hypercube, and star graphs are popular when modeling the connection structure of processors in parallel computing because they are symmetric and have a low network cost. Whereas a hypercube has a substantially smaller diameter than a torus, star graphs have been presented as an alternative to hypercubes because of their lower network cost. We propose a novel log star (LS) that is symmetric and has a lower network cost than a star graph. The LS is an undirected, recursive, and regular graph. In LSn, the number of nodes is n! while the degree is 2log2n − 1 and the diameter is 0.5n(log2n)2 + 0.75nlog2n. In this study, we analyze the basic topological properties of LS. We prove that LSn is a symmetrical connected graph and analyzed its subgraph characteristics. Then, we propose a routing algorithm and derive the diameter and network cost. Finally, the network costs of the LS and star graph-like networks are compared.

Sign in / Sign up

Export Citation Format

Share Document