This paper studies a nondiscrete generalization of T(G), the maximum cardinality of a minimal dominating set in a graph G = (K:E). In particular, a real-valued function f : V+ [0, l] is dominating ifâ€¦ (More)

This paper investigates cases where one graph parameter, upper fractional domination, is equal to three others: independence, upper domination and upper irredundance. We show that they are all equalâ€¦ (More)

Three classes of graphs, simplicial, upper bound, and middle graphs, have been known for some time, but many of their algorithmic properties have not been published. The definitions for these graphâ€¦ (More)

An introductory course for undergraduate computing students aims to integrate data structures and software engineering. In addition to completing assignments involving analysis, modeling, andâ€¦ (More)

We present a linear-time algorithm for finding a spanning tree of a biconnected graph with a given vertex as its center. Z&y words: Algorithms; Biconnected graphs; St-numbering; Center; Spanning tree

* Research supported in part by the Office of Naval Research Contracts NO001486-K-0693 and NO001486-K-0419. there exists a spanning tree T of G such that u is a centroid vertex of T. Furthermore, anâ€¦ (More)