NUMERICAL CALCULATION METHOD OF PIPELINE TRANSPORT OF LOW-COMPRESSIBLE FLUID
- 5 May 2021
- journal article
- Published by Union of Researchers of Macedonia in Advances in Mathematics: Scientific Journal
- Vol. 10 (5), 2393-2408
- https://doi.org/10.37418/amsj.10.5.8
Abstract
Let $G=(V,E)$ be a finite graph. The Generalized Fan Graph $F_{m,n}$ is defined as the graph join $\overline{K_m}+P_n$, where $\overline{K_m}$ is the empty graph on $m$ vertices and $P_n$ is the path graph on $n$ vertices. Decomposition of Generalized Fan Graph denoted by $D(F_{m,n})$. A star with $3$ edges is called a claw $S_3$. In this paper, we discuss the decomposition of Generalized Fan Graph into claws, cycles and paths.