Skip to main content
×
Home
    • Aa
    • Aa
  • Access
  • Cited by 24
  • Cited by
    This article has been cited by the following publications. This list is generated based on data provided by CrossRef.

    Hsieh, Sun-Yuan 2011. On parallel recognition of cographs. Theoretical Computer Science, Vol. 412, Issue. 8-10, p. 686.


    Sciriha, Irene and Farrugia, Stephanie 2011. On the Spectrum of Threshold Graphs. ISRN Discrete Mathematics, Vol. 2011, p. 1.


    Hsieh, Sun-Yuan 2007. A faster parallel connectivity algorithm on cographs. Applied Mathematics Letters, Vol. 20, Issue. 3, p. 341.


    Gurski, Frank 2006. Characterizations for co-graphs defined by restricted NLC-width or clique-width operations. Discrete Mathematics, Vol. 306, Issue. 2, p. 271.


    Nikolopoulos, Stavros D. and Palios, Leonidas 2005. Efficient parallel recognition of cographs. Discrete Applied Mathematics, Vol. 150, Issue. 1-3, p. 182.


    Ding, Guoli and Chen, Peter 2004. Unavoidable doubly connected large graphs. Discrete Mathematics, Vol. 280, Issue. 1-3, p. 1.


    Larrión, F de Mello, C.P Morgana, A Neumann-Lara, V and Pizaña, M.A 2004. The clique operator on cographs and serial graphs. Discrete Mathematics, Vol. 282, Issue. 1-3, p. 183.


    Lin, Rong and Olariu, Stephan 1998. A fast parallel algorithm to recognize P4-sparse graphs. Discrete Applied Mathematics, Vol. 81, Issue. 1-3, p. 191.


    Dahlhaus, Elias 1995. Efficient parallel recognition algorithms of cographs and distance hereditary graphs. Discrete Applied Mathematics, Vol. 57, Issue. 1, p. 29.


    Jamison, B. and Olariu, S. 1995. A linear-time recognition algorithm for P4-reducible graphs. Theoretical Computer Science, Vol. 145, Issue. 1-2, p. 329.


    Lin, R. Olariu, S. and Pruesse, G. 1995. An optimal path cover algorithm for cographs. Computers & Mathematics with Applications, Vol. 30, Issue. 8, p. 75.


    Ming-Shing Yu, and Chuan-Ming Liu, 1994. Proceedings of 1994 International Conference on Parallel and Distributed Systems. p. 304.

    Wanke, Egon 1994. k-NLC graphs and polynomial algorithms. Discrete Applied Mathematics, Vol. 54, Issue. 2-3, p. 251.


    Jamison, B. and Olariu, S. 1992. A tree representation for P4-sparse graphs. Discrete Applied Mathematics, Vol. 35, Issue. 2, p. 115.


    Lin, R. and Olariu, S. 1991. An NC recognition algorithm for cographs. Journal of Parallel and Distributed Computing, Vol. 13, Issue. 1, p. 76.


    Schindler, Christian 1991. Constructible hypergraphs. Discrete Mathematics, Vol. 91, Issue. 2, p. 183.


    Adhar, Gur Saran and Peng, Shietung 1990. Parallel algorithms for cographs and parity graphs with applications. Journal of Algorithms, Vol. 11, Issue. 2, p. 252.


    Kirkpatrick, D.G. and Przytycka, T. 1990. Parallel recognition of complement reducible graphs and cotree construction. Discrete Applied Mathematics, Vol. 29, Issue. 1, p. 79.


    Lin, R. and Olariu, S. 1990. Proceedings of the 5th Jerusalem Conference on Information Technology, 1990. 'Next Decade in Information Technology'. p. 402.

    Jamison, B. and Olariu, S. 1989. P4-Reducible Graphs-Class of Uniquely Tree-Representable Graphs. Studies in Applied Mathematics, Vol. 81, Issue. 1, p. 79.


    ×
  • Currently known as: Journal of the Australian Mathematical Society Title history
    Journal of the Australian Mathematical Society, Volume 18, Issue 4
  • December 1974, pp. 492-502

Dacey Graphs

  • David P. Sumner (a1)
  • DOI: http://dx.doi.org/10.1017/S1446788700029232
  • Published online: 01 April 2009
Abstract

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 AV(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].

    • Send article to Kindle

      To send this article to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle.

      Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

      Find out more about the Kindle Personal Document Service.

      Dacey Graphs
      Your Kindle email address
      Available formats
      ×
      Send article to Dropbox

      To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your Dropbox account. Find out more about sending content to Dropbox.

      Dacey Graphs
      Available formats
      ×
      Send article to Google Drive

      To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your Google Drive account. Find out more about sending content to Google Drive.

      Dacey Graphs
      Available formats
      ×
Copyright
Linked references
Hide All

This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.

[4]C. H. Randall and D. J. Foulis , ‘An approach to empirical logic’, Amer. Math. Monthly 77 (1970), 363374.

[8]D. P. Sumner , ‘Point determination in graphs’, Discrete Math. 5 (1973), 179187.

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Journal of the Australian Mathematical Society
  • ISSN: 1446-7887
  • EISSN: 1446-8107
  • URL: /core/journals/journal-of-the-australian-mathematical-society
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×
MathJax