EUDML

Advanced Search

Currently displaying 1 – 4 of 4

Order by Relevance | Title | Year of publication

System-theoretic analysis of due-time performance in production systems.

Jacobs, David; Meerkov, Semyon M. — 1995

Mathematical Problems in Engineering

Mathematical theory of improvability of production systems.

Jacobs, David; Meerkov, Semyon M. — 1995

Mathematical Problems in Engineering

Reducing the adjacency matrix of a tree.

Fricke, Gerd H.; Hedetniemi, Stephen T.; Jacobs, David P.; Trevisan, Vilmar — 1996

ELA. The Electronic Journal of Linear Algebra [electronic only]

Domination Subdivision Numbers

Teresa W. Haynes; Sandra M. Hedetniemi; Stephen T. Hedetniemi; David P. Jacobs; James Knisely; Lucas C. van der Merwe — 2001

Discussiones Mathematicae Graph Theory

A set S of vertices of a graph G = (V,E) is a dominating set if every vertex of V-S is adjacent to some vertex in S. The domination number γ(G) is the minimum cardinality of a dominating set of G, and the domination subdivision number $s d_{γ} (G)$ is the minimum number of edges that must be subdivided (each edge in G can be subdivided at most once) in order to increase the domination number. Arumugam conjectured that $1 \leq s d_{γ} (G) \leq 3$ for any graph G. We give a counterexample to this conjecture. On the other hand, we show...

Page 1