Graph property

An example graph, with the properties of being planar and being connected, and with order 6, size 7, diameter 3, girth 3, vertex connectivity 1, and degree sequence $<3, 3, 3, 2, 2, 1>$

In graph theory, a graph property or graph invariant is a property of graphs that depends only on the abstract structure, not on graph representations such as particular labellings or drawings of the graph.^[1]

^ Lovász, László (2012), "4.1 Graph parameters and graph properties", Large Networks and Graph Limits, Colloquium Publications, vol. 60, American Mathematical Society, pp. 41–42, ISBN 978-1-4704-1583-9.

[l-1] Lovász, László (2012), "4.1 Graph parameters and graph properties", Large Networks and Graph Limits, Colloquium Publications, vol. 60, American Mathematical Society, pp. 41–42, ISBN 978-1-4704-1583-9.

[1]