On non-z(mod k) dominating sets

Yair Caro; Michael S. Jacobson

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

Displaying similar documents to “On non-z(mod k) dominating sets”

Self-complementary vertex-transitive undirected graphs

Bohdan Zelinka (1979)

Mathematica Slovaca

Similarity:

On magic and supermagic line graphs

Jaroslav Ivančo, Z. Lastivková, A. Semaničová (2004)

Mathematica Bohemica

Similarity:

A graph is called magic (supermagic) if it admits a labelling of the edges by pairwise different (consecutive) positive integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex. We characterize magic line graphs of general graphs and describe some class of supermagic line graphs of bipartite graphs.

Heights in finite projective space, and a problem on directed graphs.

Nathanson, Melvyn B., Sullivan, Blair D. (2008)

Integers

Similarity:

On the minimum number of vertices and edges in a graph with a given number of spanning trees

Ladislav Nebeský (1973)

Časopis pro pěstování matematiky

Similarity:

On distances in some bipartite graphs.

Gutman, Ivan (1988)

Publications de l'Institut Mathématique. Nouvelle Série

Similarity:

Symmetry of iteration graphs

Walter Carlip, Martina Mincheva (2008)

Czechoslovak Mathematical Journal

Similarity:

We examine iteration graphs of the squaring function on the rings $ℤ / n ℤ$ when $n = 2^{k} p$ , for $p$ a Fermat prime. We describe several invariants associated to these graphs and use them to prove that the graphs are not symmetric when $k = 3$ and when $k \geq 5$ and are symmetric when $k = 4$ .