make_full_citation_graph() creates a full citation graph. This is a
directed graph, where every i->j edge is present if and only if
\(j<i\). If directed=FALSE then the graph is just a full graph.
See also
Other deterministic constructors:
graph_from_atlas(),
graph_from_edgelist(),
graph_from_literal(),
make_(),
make_chordal_ring(),
make_circulant(),
make_empty_graph(),
make_full_graph(),
make_full_multipartite(),
make_graph(),
make_lattice(),
make_ring(),
make_star(),
make_tree(),
make_turan(),
make_wheel()
Examples
print_all(make_full_citation_graph(10))
#> IGRAPH ea01946 D--- 10 45 -- Full citation graph
#> + attr: name (g/c)
#> + graph attributes:
#> | + name:
#> | [1] "Full citation graph"
#> + edges:
#> 1 -> 2 -> 1 3 -> 1 2
#> 4 -> 1 2 3 5 -> 1 2 3 4 6 -> 1 2 3 4 5
#> 7 -> 1 2 3 4 5 6 8 -> 1 2 3 4 5 6 7 9 -> 1 2 3 4 5 6 7 8
#> 10 -> 1 2 3 4 5 6 7 8 9