Institutional Repository

Browsing Department of Mathematical Sciences by Subject "Graph theory"

Browsing Department of Mathematical Sciences by Subject "Graph theory"

Sort by: Order: Results:

  • Greatest common dwisors and least common multiples of graphs 
    Saba, Farrokh (1991-11)
    Chapter I begins with a brief history of the topic of greatest common subgraphs. Then we provide a summaiy of the work done on some variations of greatest common subgraphs. Finally, in this chapter we present results ...
  • Identifying vertices in graphs and digraphs 
    Skaggs, Robert Duane (2009-08-25)
    The closed neighbourhood of a vertex in a graph is the vertex together with the set of adjacent vertices. A di®erentiating-dominating set, or identifying code, is a collection of vertices whose intersection with the ...
  • Local properties of graphs 
    De Wet, Johan Pieter (2016-10)
    We say a graph is locally P if the induced graph on the neighbourhood of every vertex has the property P. Specically, a graph is locally traceable (LT) or locally hamiltonian (LH) if the induced graph on the neighbourhood ...

Search UnisaIR


Browse

My Account