GraphProperties

GraphProperty::Type

Abstract supertype for graph properties.

The only type parameter is the type of each value of the property.

graph_property_type(::GraphProperty{T}) -> T

Get the type of each value of the property.

It is not allowed to add methods to this function.

PropertyComparison(comparison, property, value)

Turn a GraphProperty{<:Real} into a GraphProperty{Bool} by attaching a comparison against a value.

Arboricity()

The arboricity of an undirected graph.

Example:

julia> using GraphProperties

julia> Arboricity() isa GraphProperty{Integer}
true

AssortativityCoefficient()

The assortativity coefficient of an undirected graph.

Example:

julia> using GraphProperties

julia> AssortativityCoefficient() isa GraphProperty{Real}
true

BipartiteDimension()

The bipartite dimension of an undirected graph. Also known as:

• biclique cover number

Example:

julia> using GraphProperties

julia> BipartiteDimension() isa GraphProperty{Integer}
true

BookCrossingNumber()

The book crossing number of an undirected graph.

Example:

julia> using GraphProperties

julia> BookCrossingNumber() isa GraphProperty{Integer}
true

BookThickness()

The book thickness of an undirected graph. Also known as:

• pagenumber

• stacknumber

• fixed outerthickness

Example:

julia> using GraphProperties

julia> BookThickness() isa GraphProperty{Integer}
true

Boxicity()

The boxicity of an undirected graph.

Example:

julia> using GraphProperties

julia> Boxicity() isa GraphProperty{Integer}
true

Branchwidth()

The branchwidth of an undirected graph.

Example:

julia> using GraphProperties

julia> Branchwidth() isa GraphProperty{Integer}
true

CarvingWidth()

The carving width of an undirected graph.

Example:

julia> using GraphProperties

julia> CarvingWidth() isa GraphProperty{Integer}
true

CheegerConstant()

The Cheeger constant of an undirected graph. Also known as:

• Cheeger number

• isoperimetric number

Example:

julia> using GraphProperties

julia> CheegerConstant() isa GraphProperty{Real}
true

Choosability()

The choosability of an undirected graph. Also known as:

• list colorability

• list chromatic number

Example:

julia> using GraphProperties

julia> Choosability() isa GraphProperty{Integer}
true

ChromaticIndex()

The chromatic index of an undirected graph. Also known as:

• edge chromatic number

Example:

julia> using GraphProperties

julia> ChromaticIndex() isa GraphProperty{Integer}
true

ChromaticNumber()

The chromatic number of an undirected graph.

Example:

julia> using GraphProperties

julia> ChromaticNumber() isa GraphProperty{Integer}
true

Circumference()

The circumference of an undirected graph.

Example:

julia> using GraphProperties

julia> Circumference() isa GraphProperty{Real}
true

CliqueNumber()

The clique number of an undirected graph.

Example:

julia> using GraphProperties

julia> CliqueNumber() isa GraphProperty{Integer}
true

CliqueWidth()

The clique-width of an undirected graph.

Example:

julia> using GraphProperties

julia> CliqueWidth() isa GraphProperty{Integer}
true

CochromaticNumber()

The cochromatic number of an undirected graph.

Example:

julia> using GraphProperties

julia> CochromaticNumber() isa GraphProperty{Integer}
true

CrossingNumber()

The crossing number of an undirected graph.

Example:

julia> using GraphProperties

julia> CrossingNumber() isa GraphProperty{Integer}
true

Cutwidth()

The cutwidth of an undirected graph. Also known as:

• folding number

Example:

julia> using GraphProperties

julia> Cutwidth() isa GraphProperty{Integer}
true

CycleRank()

The cycle rank of a directed graph.

Example:

julia> using GraphProperties

julia> CycleRank() isa GraphProperty{Integer}
true

CyclomaticNumber()

The cyclomatic number of an undirected graph. Also known as:

• circuit rank

• cycle rank

• corank

• nullity

Example:

julia> using GraphProperties

julia> CyclomaticNumber() isa GraphProperty{Integer}
true

Degeneracy()

The degeneracy of an undirected graph. Also known as:

• width

• linkage

Example:

julia> using GraphProperties

julia> Degeneracy() isa GraphProperty{Integer}
true

DegreeSequence()

The degree sequence of an undirected graph.

Example:

julia> using GraphProperties

julia> DegreeSequence() isa GraphProperty{AbstractVector{<:Integer}}
true

Diameter()

The diameter of a connected undirected graph.

Example:

julia> using GraphProperties

julia> Diameter() isa GraphProperty{Integer}
true

DigraphIsDAG()

Is a directed graph a directed acyclic graph? Also known as:

• a DAG

Example:

julia> using GraphProperties

julia> DigraphIsDAG() isa GraphProperty{Bool}
true

DigraphIsDirectedPath()

Is a directed graph a directed path? Also known as:

• a dipath

Example:

julia> using GraphProperties

julia> DigraphIsDirectedPath() isa GraphProperty{Bool}
true

DigraphIsInForest()

Is a directed graph an in-forest? Also known as:

• an anti-branching

Example:

julia> using GraphProperties

julia> DigraphIsInForest() isa GraphProperty{Bool}
true

DigraphIsInTree()

Is a directed graph an in-tree? Also known as:

• an anti-arborescence

Example:

julia> using GraphProperties

julia> DigraphIsInTree() isa GraphProperty{Bool}
true

DigraphIsMultitree()

Is a directed graph a multitree? Also known as:

• a strongly unambiguous graph

• a mangrove

Example:

julia> using GraphProperties

julia> DigraphIsMultitree() isa GraphProperty{Bool}
true

DigraphIsOrientation()

Is a directed graph an orientation?

Example:

julia> using GraphProperties

julia> DigraphIsOrientation() isa GraphProperty{Bool}
true

DigraphIsOutForest()

Is a directed graph an out-forest? Also known as:

• a branching

Example:

julia> using GraphProperties

julia> DigraphIsOutForest() isa GraphProperty{Bool}
true

DigraphIsOutTree()

Is a directed graph an out-tree? Also known as:

• an arborescence

• a directed rooted tree

Example:

julia> using GraphProperties

julia> DigraphIsOutTree() isa GraphProperty{Bool}
true

DigraphIsPlanar()

Is a directed graph planar?

Example:

julia> using GraphProperties

julia> DigraphIsPlanar() isa GraphProperty{Bool}
true

DigraphIsPolyforest()

Is a directed graph a polyforest? Also known as:

• a directed forest

• an oriented forest

Example:

julia> using GraphProperties

julia> DigraphIsPolyforest() isa GraphProperty{Bool}
true

DigraphIsPolytree()

Is a directed graph a polytree? Also known as:

• a directed tree

• an oriented tree

Example:

julia> using GraphProperties

julia> DigraphIsPolytree() isa GraphProperty{Bool}
true

DigraphIsStronglyConnected()

Is a directed graph strongly connected?

Example:

julia> using GraphProperties

julia> DigraphIsStronglyConnected() isa GraphProperty{Bool}
true

DigraphIsWeaklyConnected()

Is a directed graph weakly connected?

Example:

julia> using GraphProperties

julia> DigraphIsWeaklyConnected() isa GraphProperty{Bool}
true

DomaticNumber()

The domatic number of an undirected graph.

Example:

julia> using GraphProperties

julia> DomaticNumber() isa GraphProperty{Integer}
true

DominationNumber()

The domination number of an undirected graph.

Example:

julia> using GraphProperties

julia> DominationNumber() isa GraphProperty{Integer}
true

EdgeConnectivity()

The edge-connectivity of an undirected graph.

Example:

julia> using GraphProperties

julia> EdgeConnectivity() isa GraphProperty{Integer}
true

EdgeCoverNumber()

The edge cover number of an undirected graph.

Example:

julia> using GraphProperties

julia> EdgeCoverNumber() isa GraphProperty{Integer}
true

FeedbackVertexSetNumber()

The feedback vertex set number of a graph.

Example:

julia> using GraphProperties

julia> FeedbackVertexSetNumber() isa GraphProperty{Integer}
true

FractionalChromaticNumber()

The fractional chromatic number of an undirected graph.

Example:

julia> using GraphProperties

julia> FractionalChromaticNumber() isa GraphProperty{Real}
true

FractionalMatchingNumber()

The fractional matching number of an undirected graph.

Example:

julia> using GraphProperties

julia> FractionalMatchingNumber() isa GraphProperty{Real}
true

Girth()

The girth of an undirected graph.

Example:

julia> using GraphProperties

julia> Girth() isa GraphProperty{Real}
true

GlobalClusteringCoefficient()

The global clustering coefficient of an undirected graph.

Example:

julia> using GraphProperties

julia> GlobalClusteringCoefficient() isa GraphProperty{Real}
true

GraphIsBipartite()

Is an undirected graph bipartite?

Example:

julia> using GraphProperties

julia> GraphIsBipartite() isa GraphProperty{Bool}
true

GraphIsBlockGraph()

Is an undirected graph a block graph? Also known as:

• a clique tree

• a Husimi tree

Example:

julia> using GraphProperties

julia> GraphIsBlockGraph() isa GraphProperty{Bool}
true

GraphIsCactus()

Is an undirected graph a cactus? Also known as:

• a Husimi tree

Example:

julia> using GraphProperties

julia> GraphIsCactus() isa GraphProperty{Bool}
true

GraphIsCartesianProduct()

Is an undirected graph a Cartesian product of two graphs? Also known as:

• a box product

Example:

julia> using GraphProperties

julia> GraphIsCartesianProduct() isa GraphProperty{Bool}
true

GraphIsChordal()

Is an undirected graph chordal?

Example:

julia> using GraphProperties

julia> GraphIsChordal() isa GraphProperty{Bool}
true

GraphIsChordalBipartite()

Is an undirected graph chordal bipartite?

Example:

julia> using GraphProperties

julia> GraphIsChordalBipartite() isa GraphProperty{Bool}
true

GraphIsCircleGraph()

Is an undirected graph a circle graph?

Example:

julia> using GraphProperties

julia> GraphIsCircleGraph() isa GraphProperty{Bool}
true

GraphIsClawFree()

Is an undirected graph claw-free?

Example:

julia> using GraphProperties

julia> GraphIsClawFree() isa GraphProperty{Bool}
true

GraphIsClusterGraph()

Is an undirected graph a cluster graph?

Example:

julia> using GraphProperties

julia> GraphIsClusterGraph() isa GraphProperty{Bool}
true

GraphIsCograph()

Is an undirected graph a cograph?

Example:

julia> using GraphProperties

julia> GraphIsCograph() isa GraphProperty{Bool}
true

GraphIsComparabilityGraph()

Is an undirected graph a comparability graph?

Example:

julia> using GraphProperties

julia> GraphIsComparabilityGraph() isa GraphProperty{Bool}
true

GraphIsComplete()

Is an undirected graph complete?

Example:

julia> using GraphProperties

julia> GraphIsComplete() isa GraphProperty{Bool}
true

GraphIsCompleteBipartite()

Is an undirected graph complete bipartite? Also known as:

• a biclique

Example:

julia> using GraphProperties

julia> GraphIsCompleteBipartite() isa GraphProperty{Bool}
true

GraphIsConnected()

Is an undirected graph connected?

Example:

julia> using GraphProperties

julia> GraphIsConnected() isa GraphProperty{Bool}
true

GraphIsCycle()

Is an undirected graph a cycle?

Example:

julia> using GraphProperties

julia> GraphIsCycle() isa GraphProperty{Bool}
true

GraphIsDistanceHereditary()

Is an undirected graph distance-hereditary?

Example:

julia> using GraphProperties

julia> GraphIsDistanceHereditary() isa GraphProperty{Bool}
true

GraphIsDistanceRegular()

Is an undirected graph distance-regular?

Example:

julia> using GraphProperties

julia> GraphIsDistanceRegular() isa GraphProperty{Bool}
true

GraphIsDistanceTransitive()

Is an undirected graph distance-transitive?

Example:

julia> using GraphProperties

julia> GraphIsDistanceTransitive() isa GraphProperty{Bool}
true

GraphIsDuallyChordal()

Is an undirected graph dually chordal?

Example:

julia> using GraphProperties

julia> GraphIsDuallyChordal() isa GraphProperty{Bool}
true

GraphIsForest()

Is an undirected graph a forest? Also known as:

• an acyclic undirected graph

Example:

julia> using GraphProperties

julia> GraphIsForest() isa GraphProperty{Bool}
true

GraphIsIndifferenceGraph()

Is an undirected graph an indifference graph?

Example:

julia> using GraphProperties

julia> GraphIsIndifferenceGraph() isa GraphProperty{Bool}
true

GraphIsIntervalGraph()

Is an undirected graph an interval graph?

Example:

julia> using GraphProperties

julia> GraphIsIntervalGraph() isa GraphProperty{Bool}
true

GraphIsLinearForest()

Is an undirected graph a linear forest? Also known as:

• an acyclic claw-free undirected graph

Example:

julia> using GraphProperties

julia> GraphIsLinearForest() isa GraphProperty{Bool}
true

GraphIsMaximalOuterplanar()

Is an undirected graph maximal outerplanar?

Example:

julia> using GraphProperties

julia> GraphIsMaximalOuterplanar() isa GraphProperty{Bool}
true

GraphIsMedianGraph()

Is an undirected graph a median graph?

Example:

julia> using GraphProperties

julia> GraphIsMedianGraph() isa GraphProperty{Bool}
true

GraphIsMeynielGraph()

Is an undirected graph a Meyniel graph?

Example:

julia> using GraphProperties

julia> GraphIsMeynielGraph() isa GraphProperty{Bool}
true

GraphIsModular()

Is an undirected graph modular?

Example:

julia> using GraphProperties

julia> GraphIsModular() isa GraphProperty{Bool}
true

GraphIsOuterplanar()

Is an undirected graph outerplanar?

Example:

julia> using GraphProperties

julia> GraphIsOuterplanar() isa GraphProperty{Bool}
true

GraphIsPath()

Is an undirected graph a path?

Example:

julia> using GraphProperties

julia> GraphIsPath() isa GraphProperty{Bool}
true

GraphIsPerfect()

Is an undirected graph perfect?

Example:

julia> using GraphProperties

julia> GraphIsPerfect() isa GraphProperty{Bool}
true

GraphIsPermutationGraph()

Is an undirected graph a permutation graph?

Example:

julia> using GraphProperties

julia> GraphIsPermutationGraph() isa GraphProperty{Bool}
true

GraphIsPlanar()

Is an undirected graph planar?

Example:

julia> using GraphProperties

julia> GraphIsPlanar() isa GraphProperty{Bool}
true

GraphIsPseudoforest()

Is an undirected graph a pseudoforest?

Example:

julia> using GraphProperties

julia> GraphIsPseudoforest() isa GraphProperty{Bool}
true

GraphIsPtolemaic()

Is an undirected graph Ptolemaic?

Example:

julia> using GraphProperties

julia> GraphIsPtolemaic() isa GraphProperty{Bool}
true

GraphIsRegular()

Is an undirected graph regular?

Example:

julia> using GraphProperties

julia> GraphIsRegular() isa GraphProperty{Bool}
true

GraphIsSplitGraph()

Is an undirected graph a split graph?

Example:

julia> using GraphProperties

julia> GraphIsSplitGraph() isa GraphProperty{Bool}
true

GraphIsSquaregraph()

Is an undirected graph a squaregraph?

Example:

julia> using GraphProperties

julia> GraphIsSquaregraph() isa GraphProperty{Bool}
true

GraphIsStar()

Is an undirected graph a star?

Example:

julia> using GraphProperties

julia> GraphIsStar() isa GraphProperty{Bool}
true

GraphIsStronglyChordal()

Is an undirected graph strongly chordal?

Example:

julia> using GraphProperties

julia> GraphIsStronglyChordal() isa GraphProperty{Bool}
true

GraphIsStronglyRegular()

Is an undirected graph strongly regular?

Example:

julia> using GraphProperties

julia> GraphIsStronglyRegular() isa GraphProperty{Bool}
true

GraphIsThresholdGraph()

Is an undirected graph a threshold graph?

Example:

julia> using GraphProperties

julia> GraphIsThresholdGraph() isa GraphProperty{Bool}
true

GraphIsTree()

Is an undirected graph a tree?

Example:

julia> using GraphProperties

julia> GraphIsTree() isa GraphProperty{Bool}
true

GraphIsTriangleFree()

Is an undirected graph triangle-free?

Example:

julia> using GraphProperties

julia> GraphIsTriangleFree() isa GraphProperty{Bool}
true

GraphIsTriviallyPerfect()

Is an undirected graph trivially perfect?

Example:

julia> using GraphProperties

julia> GraphIsTriviallyPerfect() isa GraphProperty{Bool}
true

GraphisPseudotree()

Is an undirected graph a pseudotree?

Example:

julia> using GraphProperties

julia> GraphisPseudotree() isa GraphProperty{Bool}
true

HadwigerNumber()

The Hadwiger number of an undirected graph. Also known as:

• contraction clique number

• homomorphism degree

Example:

julia> using GraphProperties

julia> HadwigerNumber() isa GraphProperty{Integer}
true

IndependenceNumber()

The independence number of an undirected graph.

Example:

julia> using GraphProperties

julia> IndependenceNumber() isa GraphProperty{Integer}
true

IntersectionNumber()

The intersection number of an undirected graph. Also known as:

• R-content

• edge clique cover number

• clique cover number

Example:

julia> using GraphProperties

julia> IntersectionNumber() isa GraphProperty{Integer}
true

IsDirectedGraph()

Is a graph a directed graph? Also known as:

• a digraph

Example:

julia> using GraphProperties

julia> IsDirectedGraph() isa GraphProperty{Bool}
true

IsUndirectedGraph()

Is a graph an undirected graph?

Example:

julia> using GraphProperties

julia> IsUndirectedGraph() isa GraphProperty{Bool}
true

MatchingNumber()

The matching number of an undirected graph.

Example:

julia> using GraphProperties

julia> MatchingNumber() isa GraphProperty{Integer}
true

MatchingPreclusionNumber()

The matching preclusion number of an undirected graph.

Example:

julia> using GraphProperties

julia> MatchingPreclusionNumber() isa GraphProperty{Integer}
true

MaximumDegree()

The maximum degree of an undirected graph.

Example:

julia> using GraphProperties

julia> MaximumDegree() isa GraphProperty{Integer}
true

MaximumIndegree()

The maximum indegree of a directed graph.

Example:

julia> using GraphProperties

julia> MaximumIndegree() isa GraphProperty{Integer}
true

MaximumOutdegree()

The maximum outdegree of a directed graph.

Example:

julia> using GraphProperties

julia> MaximumOutdegree() isa GraphProperty{Integer}
true

MinimumDegree()

The minimum degree of an undirected graph.

Example:

julia> using GraphProperties

julia> MinimumDegree() isa GraphProperty{Integer}
true

MinimumIndegree()

The minimum indegree of a directed graph.

Example:

julia> using GraphProperties

julia> MinimumIndegree() isa GraphProperty{Integer}
true

MinimumOutdegree()

The minimum outdegree of a directed graph.

Example:

julia> using GraphProperties

julia> MinimumOutdegree() isa GraphProperty{Integer}
true

NumberOfArcs()

The number of arcs of a directed graph.

Example:

julia> using GraphProperties

julia> NumberOfArcs() isa GraphProperty{Integer}
true

NumberOfConnectedComponents()

The number of connected components of an undirected graph.

Example:

julia> using GraphProperties

julia> NumberOfConnectedComponents() isa GraphProperty{Integer}
true

NumberOfEdges()

The number of edges of an undirected graph. Also known as:

• size

Example:

julia> using GraphProperties

julia> NumberOfEdges() isa GraphProperty{Integer}
true

NumberOfStronglyConnectedComponents()

The number of strongly connected components of a directed graph.

Example:

julia> using GraphProperties

julia> NumberOfStronglyConnectedComponents() isa GraphProperty{Integer}
true

NumberOfVertices()

The number of vertices of a graph. Also known as:

• order

Example:

julia> using GraphProperties

julia> NumberOfVertices() isa GraphProperty{Integer}
true

NumberOfWeaklyConnectedComponents()

The number of weakly connected components of a directed graph.

Example:

julia> using GraphProperties

julia> NumberOfWeaklyConnectedComponents() isa GraphProperty{Integer}
true

Pagewidth()

The pagewidth of an undirected graph.

Example:

julia> using GraphProperties

julia> Pagewidth() isa GraphProperty{Integer}
true

Pathwidth()

The pathwidth of an undirected graph. Also known as:

• interval thickness

• vertex separation number

• node searching number

Example:

julia> using GraphProperties

julia> Pathwidth() isa GraphProperty{Integer}
true

Pseudoarboricity()

The pseudoarboricity of an undirected graph.

Example:

julia> using GraphProperties

julia> Pseudoarboricity() isa GraphProperty{Integer}
true

QueueNumber()

The queue number of an undirected graph.

Example:

julia> using GraphProperties

julia> QueueNumber() isa GraphProperty{Integer}
true

Radius()

The radius of a connected undirected graph.

Example:

julia> using GraphProperties

julia> Radius() isa GraphProperty{Integer}
true

RectilinearCrossingNumber()

The rectilinear crossing number of an undirected graph.

Example:

julia> using GraphProperties

julia> RectilinearCrossingNumber() isa GraphProperty{Integer}
true

Sphericity()

The sphericity of an undirected graph.

Example:

julia> using GraphProperties

julia> Sphericity() isa GraphProperty{Integer}
true

Splittance()

The splittance of an undirected graph.

Example:

julia> using GraphProperties

julia> Splittance() isa GraphProperty{Integer}
true

Strength()

The strength of an undirected graph.

Example:

julia> using GraphProperties

julia> Strength() isa GraphProperty{Real}
true

StrongDominationNumber()

The strong domination number of an undirected graph.

Example:

julia> using GraphProperties

julia> StrongDominationNumber() isa GraphProperty{Integer}
true

SubchromaticNumber()

The subchromatic number of an undirected graph.

Example:

julia> using GraphProperties

julia> SubchromaticNumber() isa GraphProperty{Integer}
true

Thickness()

The thickness of an undirected graph.

Example:

julia> using GraphProperties

julia> Thickness() isa GraphProperty{Integer}
true

TotalChromaticNumber()

The total chromatic number of an undirected graph.

Example:

julia> using GraphProperties

julia> TotalChromaticNumber() isa GraphProperty{Integer}
true

TreeDepth()

The tree-depth of an undirected graph.

Example:

julia> using GraphProperties

julia> TreeDepth() isa GraphProperty{Integer}
true

Treewidth()

The treewidth of an undirected graph.

Example:

julia> using GraphProperties

julia> Treewidth() isa GraphProperty{Integer}
true

Triameter()

The triameter of a connected undirected graph.

Example:

julia> using GraphProperties

julia> Triameter() isa GraphProperty{Integer}
true

TwinWidth()

The twin-width of an undirected graph.

Example:

julia> using GraphProperties

julia> TwinWidth() isa GraphProperty{Integer}
true

VertexConnectivity()

The vertex-connectivity of an undirected graph. Also known as:

• connectivity

Example:

julia> using GraphProperties

julia> VertexConnectivity() isa GraphProperty{Integer}
true

VertexCoverNumber()

The vertex cover number of an undirected graph.

Example:

julia> using GraphProperties

julia> VertexCoverNumber() isa GraphProperty{Integer}
true