Downloads provided by UsageCounts
Many results have been obtained on isolated graphs and complete graphs. In this paper, a necessary and sufficient condition will be proved for a single valued neutrosophic graph to be an isolated single valued neutrosophic graph.
Electronic computers. Computer science, QA1-939, complete single valued neutrosophic graphs, QA75.5-76.95, Single valued neutrosophic graphs, Mathematics
Electronic computers. Computer science, QA1-939, complete single valued neutrosophic graphs, QA75.5-76.95, Single valued 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). | 3 | |
| 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 | 9 | |
| downloads | 7 |

Views provided by UsageCounts
Downloads provided by UsageCounts