GraphTheory - Maple Programming Help

Online Help

All Products    Maple    MapleSim


Home : Support : Online Help : Mathematics : Discrete Mathematics : Graph Theory : GraphTheory Package : GraphTheory/DistancePolynomial

GraphTheory

  

DistancePolynomial

  

compute distance polynomial

 

Calling Sequence

Parameters

Description

Definition

Examples

Compatibility

Calling Sequence

DistancePolynomial(G, x)

Parameters

G

-

undirected connected graph

x

-

variable or value

Description

• 

DistancePolynomial returns the distance polynomial for the connected graph G in the variable x.

Definition

• 

For an undirected connected graph G, the distance polynomial of G is defined to be the characteristic polynomial of the graph distance matrix.

Examples

with(GraphTheory):

P := Graph( {{1,2},{2,3},{3,4}} ); # a path

PGraph 1: an undirected unweighted graph with 4 vertices and 3 edge(s)

(1)

DistancePolynomial(P,x);

x420x232x12

(2)

C := CycleGraph( 5 ); # a cycle

CGraph 2: an undirected unweighted graph with 5 vertices and 5 edge(s)

(3)

DistancePolynomial(C,x);

x525x360x235x6

(4)

Compatibility

• 

The GraphTheory[DistancePolynomial] command was introduced in Maple 2018.

• 

For more information on Maple 2018 changes, see Updates in Maple 2018.

See Also

AllPairsDistance

Distance