Ordered graph
id:
ordered-graph-301-9850962
title:
Ordered graph
text:
An ordered graph is a graph with a total order over its nodes. In an ordered graph, the parents of a node are the nodes that are adjacent to it and precede it in the ordering. More precisely, n is a parent of m in the ordered graph ⟨ N , E , < ⟩ if ∈ E and n < m . The width of a node is the number of its parents, and the width of an ordered graph is the maximal width of its nodes. The induced graph of an ordered graph is obtained by adding some edges to an ordering graph, using the method outlin
brand slug:
wiki
category slug:
encyclopedia
description:
Graph with a total order over its nodes
original url:
https://en.wikipedia.org/wiki/Ordered_graph
date created:
date modified:
2024-02-03T07:57:54Z
main entity:
{"identifier":"Q17143897","url":"https://www.wikidata.org/entity/Q17143897"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/7/7a/Induced-1.svg","width":225,"height":162}
fields total:
13
integrity:
15