A new approach to complete graph
A graph consists of a nonempty vertex set and an edge set, denoted G=(V,\ E). An unordered pair of edge {v,w} is known as an undirected edge and an ordered pair of edge (v,\ w) is known as a directed edge. A graph with directed edges is called a directed graph, simply a digraph; otherwise an undirec...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
BİSKA Bilisim Company
2017-03-01
|
| Series: | New Trends in Mathematical Sciences |
| Subjects: | |
| Online Access: | https://ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8262 |