1. The 3-path-step operator on trees and unicyclic graphs
- Creator:
- Zelinka, Bohdan
- Format:
- bez média and svazek
- Type:
- model:article and TEXT
- Subject:
- 3-path-step graph operator, tree, and unicyclic graph
- Language:
- English
- Description:
- E. Prisner in his book Graph Dynamics defines the k-path-step operator on the class of finite graphs. The k-path-step operator (for a positive integer k) is the operator S' k which to every finite graph G assigns the graph S' k(G) which has the same vertex set as G and in which two vertices are adjacent if and only if there exists a path of length k in G connecting them. In the paper the trees and the unicyclic graphs fixed in the operator S' 3 are studied.
- Rights:
- http://creativecommons.org/publicdomain/mark/1.0/ and policy:public