rlgt.graphs.special_graphs

module documentation

This Python module contains classes that inherit from the Graph class and provide ways to construct k-edge-colored looped complete graphs with specific structures.

Class AlmostCompleteGraph This class inherits from the Graph class and is used to instantiate almost-complete graphs. Specifically, it produces a 2-edge-colored loopless complete undirected graph of order n in which all edges are colored with color 1, except for the edge between vertices ...
Class BookGraph This class inherits from the Graph class and is used to instantiate book graphs. Specifically, it produces a 2-edge-colored loopless complete undirected graph such that its edges colored with the color 1 form a book graph, while all other edges are colored with the color 0...
Class CompleteBipartiteGraph This class inherits from the Graph class and is used to instantiate complete bipartite graphs. Specifically, it produces a 2-edge-colored loopless complete undirected graph in which the edges colored with color 1 form a complete bipartite graph, while all remaining edges are colored with color 0...
Class CompleteGraph This class inherits from the Graph class and is used to instantiate complete graphs. Specifically, it produces a 2-edge-colored loopless complete undirected graph of a given order in which all edges are colored with color 1...
Class CompleteKPartiteGraph This class inherits from the Graph class and is used to instantiate complete k-partite graphs. Specifically, it produces a 2-edge-colored loopless complete undirected graph in which the edges colored with color 1 form a complete ...
Class CycleGraph This class inherits from the Graph class and is used to instantiate cycle graphs. It produces a 2-edge-colored loopless complete undirected graph in which the edges colored with the color 1 form a cycle graph, while all other edges are colored with the color 0...
Class EmptyGraph This class inherits from the Graph class and is used to instantiate empty graphs. Specifically, it produces a 2-edge-colored loopless complete undirected graph of a given order in which all edges are colored with color 0...
Class FriendshipGraph This class inherits from the Graph class and is used to instantiate friendship graphs. Specifically, it produces a 2-edge-colored loopless complete undirected graph such that its edges colored with the color 1 form a friendship graph, while all other edges are colored with the color 0...
Class MonochromaticGraph This class inherits from the Graph class and is used to create monochromatic graphs, i.e., k-edge-colored looped complete graphs where all edges (resp. arcs) share the same color or are all uncolored. ...
Class PathGraph This class inherits from the Graph class and is used to instantiate path graphs. It produces a 2-edge-colored loopless complete undirected graph in which the edges colored with the color 1 form a path graph, while all other edges are colored with the color 0...
Class StarGraph This class inherits from the Graph class and is used to instantiate star graphs. Specifically, it produces a 2-edge-colored loopless complete undirected graph in which the edges colored with color 1 form a star graph, while all remaining edges are colored with color 0...
Class WheelGraph This class inherits from the Graph class and is used to instantiate wheel graphs. It produces a 2-edge-colored loopless complete undirected graph in which the edges colored with the color 1 form a wheel graph, while all other edges are colored with the color 0...