Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-14T10:47:36.228Z Has data issue: false hasContentIssue false
  • English
  • Français

Dacey Graphs

Published online by Cambridge University Press:  09 April 2009

David P. Sumner
David P. Sumner
Affiliation:
Department of MathematicsUniversity of South CarolinaColumbia, South Carolina 29208, U. S. A.
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

In this paper our graphs will be finite, undirected, and without loops or multiple edges. We will denote the set of vertices of a graph G by V(G). If G is a graph and u, v∈V(G), then we will write u ∼ v to denote that u and v are adjacent and u ≁ v otherwise. If A ⊆ V(G), then we let N(A) = {u∈ V(G)|u ∼ a for each a ∈A}. However we write N(v) instead of N({v}). When there is no chance of confusion, we will not distinguish between a subset A ⊆ V(G) of vertices of G and the subgraph that it induces. We will denote the cardinality of a set A by |A|. The degree of a vertex v is δ(v) = |N(v)|. Any undefined terminology in this paper will generally conform with Behzad and Chartrand [1].

Information

Type
Research Article
Information
Journal of the Australian Mathematical Society , Volume 18 , Issue 4 , December 1974, pp. 492 - 502
Copyright
Copyright © Australian Mathematical Society 1974

References

[1]Bchzad, M. and Chartrand, G., Introduction to the theory of graphs (Allyn and Bacon, Inc., Boston 1972).Google Scholar
[2]Dirac, G. A., ‘Some theorems on abstract graphs’, Proc. London Math. Soc. 2 (1952), 69–81.CrossRefGoogle Scholar
[3]Foulis, D. J., Empirical logic xeroxed course notes, (University of Massachusetts, Amherst, Massachusetts (1960–1970).)Google Scholar
[4]Randall, C. H. and Foulis, D. J., ‘An approach to empirical logic’, Amer. Math. Monthly 77 (1970), 363–374.Google Scholar
[5]Randall, C. H. and Foulis, D. J., ‘Operational statistics, I: basic concepts’, J. Mathematical Phys. 13 (1972), 1667–1675.Google Scholar
[6]Greechie, R. J. and Miller, F. R. and others, On structures related to states on an empirical logic, I: weights on finite spaces, mimeographed notes, (Kansas State University Manhattan, Kansas 1970).Google Scholar
[7]Jeffcott, B. L., Orthologics (Ph. D. Dissertation, University of Massachusetts, Amherst, Massachusetts (1971).)Google Scholar
[8]Sumner, D. P., ‘Point determination in graphs’, Discrete Math. 5 (1973), 179–187.CrossRefGoogle Scholar
[9]Sumner, D. P., Indecomposable graphs, (Ph. D. Dissertation, University of Massachusetts, Amherst, Massachusetts (1971).)Google Scholar