Relative expressiveness of the edge/adjacency language for graph theory
T. McKee (1984)
Fundamenta Mathematicae
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Nondeterminism versus determinism of finite automata over directed acyclic graphs.”
Relative expressiveness of the edge/adjacency language for graph theory
Uniquely edge colourable graphs
Juraj Bosák (1984)
Mathematica Slovaca
Similarity:
Equivalences between isomorphism classes on infinite graphs
Bohdan Zelinka (1992)
Mathematica Bohemica
Similarity:
The paper studies some equivalence relations between isomorphism classes of countable graphs which correspond in a certain sense to various distances between isomorphism classes of finite graphs.
On independent vertices and edges of belt graphs.
Gutman, I. (1996)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Edge rotations and distance between graphs
Gary Chartrand, Farrokh Saba, Hung Bin Zou (1985)
Časopis pro pěstování matematiky
Similarity:
A survey of the algorithmic properties of simplicial, upper bound and middle graphs.
Cheston, Grant A., Jap, Tjoen Seng (2006)
Journal of Graph Algorithms and Applications
Similarity:
Survey of certain valuations of graphs
Martin Bača, J.A. MacDougall, Mirka Miller, Slamin, W.D. Wallis (2000)
Discussiones Mathematicae Graph Theory
Similarity:
The study of valuations of graphs is a relatively young part of graph theory. In this article we survey what is known about certain graph valuations, that is, labeling methods: antimagic labelings, edge-magic total labelings and vertex-magic total labelings.