An upper bound on the domination number of a graph.
Dánut Marcu (1986)
Mathematica Scandinavica
Similarity:
Dánut Marcu (1986)
Mathematica Scandinavica
Similarity:
F. Harary, P.C. Kainen, A.J. Schwenk (1973)
Mathematica Scandinavica
Similarity:
Don R. Lick (1976)
Colloquium Mathematicae
Similarity:
D. M. Cvetković (1975)
Matematički Vesnik
Similarity:
Dragoš M. Cvetković, Irena Pevac (1983)
Publications de l'Institut Mathématique
Similarity:
J. Nieminen (1975)
Applicationes Mathematicae
Similarity:
Exoo, Geoffrey (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
А.В. Кравченко, A. V. Kravčenko, A. V. Kravčenko, A. V. Kravčenko (1997)
Algebra i Logika
Similarity:
Tiang Poomsa-ard, Jeerayut Wetweerapong, Charuchai Samartkoon (2005)
Discussiones Mathematicae - General Algebra and Applications
Similarity:
Graph algebras establish a connection between directed graphs without multiple edges and special universal algebras of type (2,0). We say that a graph G satisfies an identity s ≈ t if the corresponding graph algebra A(G) satisfies s ≈ t. A graph G = (V,E) is called a transitive graph if the corresponding graph algebra A(G) satisfies the equation x(yz) ≈ (xz)(yz). An identity s ≈ t of terms s and t of any type t is called a hyperidentity of an algebra A̲ if whenever the operation symbols...
S. Kundu, A. Okuyama (1993)
Mathematica Scandinavica
Similarity: