Article

# The diameter of total domination vertex critical graphs.

• ##### Lucas C. van der Merwe
Discrete Mathematics (Impact Factor: 0.58). 01/2004; 286:255-261. DOI: 10.1016/j.disc.2004.05.010
Source: DBLP

ABSTRACT A graph G with no isolated vertex is total domination vertex critical if for any vertex v of G that is not adjacent to a vertex of degree one, the total domination number of G v is less than the total domination number of G. These graphs we call t-critical. If such a graph G has total domination number k, we call it k-t-critical. We characterize the connected graphs with minimum degree one that are t-critical and we obtain sharp bounds on their maximum diameter. We calculate the maximum diameter of a k-t-critical graph for k � 8 and provide an example which shows that the maximum diameter is in general at least 5k/3 O(1).

0 Bookmarks
·
63 Views
• Source
##### Article: A constructive characterization of total domination vertex critical graphs.
[Hide abstract]
ABSTRACT: Let G be a graph of order n and maximum degree Δ(G) and let γt(G) denote the minimum cardinality of a total dominating set of a graph G. A graph G with no isolated vertex is the total domination vertex critical if for any vertex v of G that is not adjacent to a vertex of degree one, the total domination number of G−v is less than the total domination number of G. We call these graphs γt-critical. For any γt-critical graph G, it can be shown that n≤Δ(G)(γt(G)−1)+1. In this paper, we prove that: Let G be a connected γt-critical graph of order n (n≥3), then n=Δ(G)(γt(G)−1)+1 if and only if G is regular and, for each v∈V(G), there is an A⊆V(G)−{v} such that N(v)∩A=0̸, the subgraph induced by A is 1-regular, and every vertex in V(G)−A−{v} has exactly one neighbor in A.
Discrete Mathematics 01/2009; 309:991-996. · 0.58 Impact Factor
• Source
##### Article: On the 3-$\gamma_t$-Critical Graphs of Order $\Delta(G)+3$
[Hide abstract]
ABSTRACT: Let $\gamma_t(G)$ be the total domination number of graph $G$, a graph $G$ is $k$-total domination vertex critical (or\ just\ $k$-$\gamma_t$-critical) if $\gamma_t(G)=k$, and for any vertex $v$ of $G$ that is not adjacent to a vertex of degree one, $\gamma_t(G-v)=k-1$. Mojdeh and Rad \cite{MR06} proposed an open problem: Does there exist a 3-$\gamma_t$-critical graph $G$ of order $\Delta(G)+3$ with $\Delta(G)$ odd? In this paper, we prove that there exists a 3-$\gamma_t$-critical graph $G$ of order $\Delta(G)+3$ with odd $\Delta(G)\geq 9$.
03/2011;
• Source
##### Article: A Computerized Ground Water Monitoring System
[Hide abstract]
ABSTRACT: This article describes a computer automated, hydrologic analysis system designed to allow the collection of high quality, long-term pumping test data. The instrument solves two of the major problems encountered in the field during aquifer tests: insufficient data, particularly during the early part of a test when drawdown is rapid; and high labor costs associated with long-term monitoring.To illustrate the system's application, results are presented from the test of a highly transmissive aquifer. The aquifer's drawdown response was rapid; thus the time-drawdown curve was essentially flat after the first two minutes of the test, and correspondingly rapid data acquisition was essential for a unique solution of the aquifer's three-dimensional hydraulic conductivities.
Ground Water Monitoring and Remediation 02/1984; 4(1):21 - 25. · 1.05 Impact Factor