Graph operations

mathematical technique to simplify the analysis of an electrical network

graph with same nodes but exactly those edges which are missing in the original graph

graph representing faces of another graph

concept in graph theory

another graph, formed from a subset of the vertices of the graph and all of the edges connecting pairs of vertices in that subset

directed graph formed by reversing every edge of another directed graph

operation that removes an edge from a graph and combines its endpoints into a single vertex

operation producing new graphs from old ones

thumb|The Turán graph T(13,4) is a cograph In graph theory, a cograph, or complement-reducible graph, or '''P4-free graph', is a graph that can be generated from the single-vertex graph K1 by complementation and disjoint union. That is, the family of cographs is the smallest class of graphs that includes K''1 and is closed under complementation and disjoint union.

recursively-formed graph with two terminal vertices

In the mathematical area of graph theory, the Mycielskian or Mycielski graph of an undirected graph is a larger graph formed from it by a construction of . The construction preserves the property of being triangle-free but increases the chromatic number; by applying the construction repeatedly to a triangle-free starting graph, Mycielski showed that there exist triangle-free graphs with arbitrarily large chromatic number.

graph operation