k3_ladder: A function that look for a k3 ladder.

In kelvinyangli/wrsgraph:

Description

This function finds the length of the k3 (triangle) ladder starts from the given simplicial node. It returns the number of adjancet k3s. It also returns the value -1 if the initial k3 shares an edge with either a k4 or two k3s, and value 0 if the initial k3 and 3 other k3s form a triangle.

Usage

k3_ladder(graph, s, x, y, l)

Arguments

graph	A graph that is stored in an adjacency matrix.
s	A simplicial node in the graph.
x	One neighbour of the node s.
y	The other neighbour of the node s.
l	The number of k3s adjacent togethers. It starts from 1.

kelvinyangli/wrsgraph documentation built on Sept. 6, 2019, 10 a.m.