Downloads provided by UsageCounts
In this paper, we introduce the concept of balanced neutrosophic graphs based on density functions and investigate some of their properties. The necessary conditions for a neutrosophic graph to be a balanced neutrosophic graph are identified if graph G is a selfcomplementary, regular, complete, and strong neutrosophic graph. Some properties of complement neutrosophic graphs are presented here.
Electronic computers. Computer science, density of a neutrosophic graphs, QA1-939, QA75.5-76.95, balanced neutrosophic graphs, Density of a neutrosophic graphs, Balanced neutrosophic graphs, Mathematics
Electronic computers. Computer science, density of a neutrosophic graphs, QA1-939, QA75.5-76.95, balanced neutrosophic graphs, Density of a neutrosophic graphs, Balanced neutrosophic graphs, Mathematics
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
| views | 7 | |
| downloads | 4 |

Views provided by UsageCounts
Downloads provided by UsageCounts