Graphtheory User Manual
User Manual:
Open the PDF directly: View PDF
Page Count: 27
- Introduction
- Constructing graphs
- Creating graphs from scratch: graph, digraph
- Promoting to directed and/or weighted graphs: make_directed, make_weighted
- Cycle graphs: cycle_graph
- Path graphs: path_graph
- Trail of edges: trail
- Complete graphs: complete_graph, complete_binary_tree, complete_kary_tree
- Creating graph from a graphic sequence: is_graphic_sequence, sequence_graph
- Interval graphs: interval_graph
- Star graphs: star_graph
- Wheel graphs: wheel_graph
- Web graphs: web_graph
- Prism graphs: prism_graph
- Antiprism graphs: antiprism_graph
- Grid graphs: grid_graph, torus_grid_graph
- Kneser graphs: kneser_graph, odd_graph
- Sierpinski graphs: sierpinski_graph
- Generalized Petersen graphs: petersen_graph
- Creating isomorphic graphs: isomorphic_copy, permute_vertices, relabel_vertices
- Extracting subgraphs of a graph: subgraph, induced_subgraph
- Underlying graph: underlying_graph
- Reversing the edge directions: reverse_graph
- Graph complement: graph_complement
- Union of graphs: graph_union, disjoint_union
- Joining two graphs: graph_join
- Graph power: graph_power
- Reversing the edge directions: reverse_graph
- Graph product: cartesian_product, tensor_product
- Seidel switch: seidel_switch
- Modifying graphs
- Adding and removing vertices: add_vertex, delete_vertex
- Adding and removing edges or arcs: add_edge, add_arc, delete_edge, delete_arc
- Setting edge weights: set_edge_weight, get_edge_weight
- Contracting edges: contract_edge
- Subdividing edges: subdivide_edges
- Graph attributes: set_graph_attribute, get_graph_attribute, discard_graph_attribute, list_graph_attributes
- Vertex attributes: set_vertex_attribute, get_vertex_attribute, discard_vertex_attribute, list_vertex_attributes
- Edge attributes: set_edge_attribute, get_edge_attribute, discard_edge_attribute, list_edge_attributes
- Import and export
- Graph properties
- Traversing graphs
- Visualizing graphs