Threshold graph
id:
threshold-graph-293-11013026
title:
Threshold graph
text:
In graph theory, a threshold graph is a graph that can be constructed from a one-vertex graph by repeated applications of the following two operations: Addition of a single isolated vertex to the graph.
Addition of a single dominating vertex to the graph, i.e. a single vertex that is connected to all other vertices. For example, the graph of the figure is a threshold graph. It can be constructed by beginning with a single-vertex graph, and then adding black vertices as isolated vertices and red
brand slug:
wiki
category slug:
encyclopedia
description:
Graph formed by adding isolated or universal vertices
original url:
https://en.wikipedia.org/wiki/Threshold_graph
date created:
date modified:
2023-01-29T17:40:13Z
main entity:
{"identifier":"Q943345","url":"https://www.wikidata.org/entity/Q943345"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/0/00/Threshold_graph.png","width":290,"height":305}
fields total:
13
integrity:
15