Enable JavaScript to interact with content and submit forms on Wolfram websites. Learn how

Wolfram Language & System Documentation Center

VertexWeightedGraphQ

VertexWeightedGraphQ[g]

yields True if the graph g is a vertex-weighted graph, and False otherwise.

Details

VertexWeightedGraphQ will give True if there is an explicit VertexWeight property defined.

Examples

open all close all

Basic Examples (1)

Test whether a graph is a vertex-weighted graph:

Wolfram Language code: VertexWeightedGraphQ[CompleteGraph[5, VertexWeight -> Range[5]]]

Scope (7)

VertexWeightedGraphQ works with undirected graphs:

Wolfram Language code: VertexWeightedGraphQ[[image]]

Directed graphs:

Wolfram Language code: VertexWeightedGraphQ[[image]]

Weighted graphs:

Wolfram Language code: VertexWeightedGraphQ[[image]]

Multigraphs:

Wolfram Language code: VertexWeightedGraphQ[[image]]

Mixed graphs:

Wolfram Language code: VertexWeightedGraphQ[[image]]

VertexWeightedGraphQ gives False for anything that is not a vertex-weighted graph:

Wolfram Language code: VertexWeightedGraphQ[x]

Wolfram Language code: VertexWeightedGraphQ[Graph[garbage]]

VertexWeightedGraphQ works with large graphs:

Wolfram Language code: GridGraph[{10, 10, 10, 10}, VertexWeight -> RandomReal[{0, 1}, 10000]];

Wolfram Language code: VertexWeightedGraphQ[%] // Timing

Properties & Relations (2)

The vertex-weighted graph is always a weighted graph:

Wolfram Language code: g = GridGraph[{3, 4}, VertexWeight -> RandomReal[{0, 1}, 12]]

Wolfram Language code: VertexWeightedGraphQ[g]

Wolfram Language code: WeightedGraphQ[g]

The weighted graph is not always a vertex-weighted graph:

Wolfram Language code: g = GridGraph[{3, 4}, EdgeWeight -> RandomReal[{0, 1}, 17]]

Wolfram Language code: WeightedGraphQ[g]

Wolfram Language code: VertexWeightedGraphQ[g]

Possible Issues (1)

VertexWeightedGraphQ gives False for non-explicit graphs:

Wolfram Language code: VertexWeightedGraphQ[CompleteGraph[n]]

Top