Search the World's Largest Database of Information Science & Technology Terms & Definitions
InfInfoScipedia LogoScipedia
A Free Service of IGI Global Publishing House
Below please find a list of definitions for the term that
you selected from multiple scholarly research resources.

What is Spanning Tree

Chapter 9
Neutrosophic Graph Theory and Algorithms
A tree is T said to be a spanning tree of a connected graph G if T is a subgraph of G and T contains all the vertices of G.
Published in Chapter:
Minimal Spanning Tree in Cylindrical Single-Valued Neutrosophic Arena
Avishek Chakraborty (Narula Institute of Technology, India)
Copyright: © 2020 |Pages: 19
DOI: 10.4018/978-1-7998-1313-2.ch009
Abstract
In this chapter, the concept of cylindrical single-valued neutrosophic number whenever two of the membership functions, which serve a crucial role for uncertainty conventional problem, are dependent to each other is developed. It also introduces a new score and accuracy function for this special cylindrical single valued neutrosophic number, which are useful for crispification. Further, a minimal spanning tree execution technique is proposed when the numbers are in cylindrical single-valued neutrosophic nature. This noble idea will help researchers to solve daily problems in the vagueness arena.
Full Text Chapter Download: US $37.50 Add to Cart
More Results
Chapter 12
Balanced Energy Consumption Approach Based on Ant Colony in Wireless Sensor Networks
A spanning tree for a graph G is a sub graph of G that includes every vertex of G and contains no cycle.
Published in Chapter: Balanced Energy Consumption Approach Based on Ant Colony in Wireless Sensor Networks; From: Handbook of Research on Natural Computing for Optimization Problems
Full Text Chapter Download: US $37.50 Add to Cart
eContent Pro Discount Banner
InfoSci OnDemandECP Editorial ServicesAGOSR