The transition of copper cable technology to fiber optic is very triggering the development of
technology where data can be transmitted quickly and accurately. This cable change can be …

In this chapter, we introduce a new algorithm for finding a minimum spanning tree (MST) of
an undirected neutrosophic weighted connected graph whose edge weights are …

A single valued trapezoidal neutrosophic number (SVTNN) is a special case of single
valued neutrosophic set (SVNS), which is defined on real number set. This paper …

The minimum spanning tree problem usually finds a spanning tree with the least total weight
in a connected undirected graph. Minimum spanning trees have direct applications in the …

Finding a minimum cost spanning tree (MST) plays a key role in many applications. For a
given graph G (V, E), there may be more than one spanning tree (ST) that can be …

Importance of minimum spanning tree is used to find the smallest path which includes all the
nodes in the network. Minimum spanning tree can be obtained using classical algorithms …

Wireless Sensor Network (WSN) clustering structure offer many features like network
scalability, communication overhead reduction, and fault tolerance. When aggregate …

Minimal Spanning tree (MST) is a fundamental problem in networking design. The problem
of constructing MST of an undirected connected weighted graph belongs to the group of …

A spanning tree is a sub graph obtained from a connected graph which contains all the
vertices of a graph. For a connected graph there may be many spanning trees. A minimum …

In this chapter, we introduce a new algorithm for finding a minimum spanning tree (MST) of
an undirected neutrosophic weighted connected graph whose edge weights are …