Related items
Showing items related by title, author, creator and subject.

Use of the TRAC PAC as a microcomputerbased laboratory (MBL) tool for addressing misconceptions in kinematics and kinematic graphs held by secondary school learners
Green, W. J.(Whitfield James) (Stellenbosch : Stellenbosch University, 200412)ENGLISH ABSTRACT: This study investigated the impact that use of a microcomputerbased laboratory (MBL), in this case the TRAC PAC and associated software, had on student understanding in relation to common 'alternative ...

Graph Theoretic Applications to Disease Models
Mukwembi S; Rodrigues BG; Nyabadza F (Nova Science Publishers, Inc., 2013)

On the (r,s)domination number of a graph
Roux, Adriana (Stellenbosch : Stellenbosch University, 201404)ENGLISH ABSTRACT: The (classical) domination number of a graph is the cardinality of a smallest subset of its vertex set with the property that each vertex of the graph is in the subset or adjacent to a vertex in the subset. ...

Random walks on graphs
Oosthuizen, Joubert (Stellenbosch : Stellenbosch University, 201404)ENGLISH ABSTRACT: We study random walks on nite graphs. The reader is introduced to general Markov chains before we move on more specifically to random walks on graphs. A random walk on a graph is just a Markov chain ...

The crossing number of a graph in the plane
Winterbach, Wynand (Stellenbosch : University of Stellenbosch, 200503)Heuristics for obtaining upper bounds on crossing numbers of small graphs in the plane, and a heuristic for obtaining lower bounds to the crossing numbers of large graphs in the plane are presented in this thesis. It is ...

Vertexcriticality of the domination parameters of graphs
Roux, Adriana (Stellenbosch : University of Stellenbosch, 201103)Please refer to full text to view abstract.

Energy and related graph invariants
Andriantiana, Eric Ould Dadah (Stellenbosch : Stellenbosch University, 201312)Please refer to full text to view abstract.

Two algorithms for secure graph domination
Burger AP; de Villiers AP; Van Vuuren JH (2013)

A binary programming approach towards achieving effective graph protection
Burger AP; de Villiers AP; Van Vuuren JH (ORSSA, 2013)

An algorithm for 〈r,s〉domination of a graph
Roux A; Van Vuuren JH (ORSSA, 2013)

An iterative approach to the traceability conjecture for oriented graphs
van Aardt SA; Burger AP; Dunbar SE; Frick M; Harris JM; Singleton JE (ELECTRONIC JOURNAL OF COMBINATORICS, C/O FELIX LAZEBNIK, RM 507, EWING HALL,UNIV DELAWARE, DEPT MATHEMATICAL SCIENCES, NEWARK, USA, DE, 19716, 2013)

An infinite family of planar hypohamiltonian oriented graphs
van Aardt SA; Burger AP; Frick M (SPRINGER TOKYO, 3313, HONGO, BUNKYOKU, TOKYO, JAPAN, 1130033, 2013)

Further results on maximal nontraceable graphs of smallest size
Burger AP; Singleton JE (DISCRETE MATHEMATICS THEORETICAL COMPUTER SCIENCE, 62 RUE DU CARDINAL MATHIEU,NANCY, FRANCE, F54000, 2013)

Computational results on the traceability of oriented graphs of small order
Burger AP (ELECTRONIC JOURNAL OF COMBINATORICS, C/O FELIX LAZEBNIK, RM 507, EWING HALL,UNIV DELAWARE, DEPT MATHEMATICAL SCIENCES, NEWARK, USA, DE, 19716, 2013)

A graphtheoretic proof of the nonexistence of selforthogonal Latin squares of order 6
Burger A.P.; Kidd M.P.; Van Vuuren J.H. (2011)The nonexistence of a pair of mutually orthogonal Latin squares of order six is a wellknown result in the theory of combinatorial designs. It was conjectured by Euler in 1782 and was first proved by Tarry in 1900 by means ...

Bounds for Ramsey numbers in multipartite graphs
Stipp, Eugene Heinz (Stellenbosch : Stellenbosch University, 200012)ENGLISH ABSTRACT: The notion of a classical graph theoretic Ramsey number is generalized by assuming that both the original graph whose edges are arbitrarily bicoloured and the monochromatic subgraphs to be forced are ...

Secondary and early tertiary students' understanding of graphs of motion
Frauenknecht, R.(Reinhard) (Stellenbosch : Stellenbosch University, 1998)

On the maximum degree chromatic number of a graph
Nieuwoudt, Isabelle (Stellenbosch : Stellenbosch University, 200712)ENGLISH ABSTRACT: Determining the (classical) chromatic number of a graph (i.e. finding the smallest number of colours with which the vertices of a graph may be coloured so that no two adjacent vertices receive the same ...

Unicyclic graphs with large energy
Andriantiana E.O.D.; Wagner S. (2011)We study the energy (i.e., the sum of the absolute values of all eigenvalues) of socalled tadpole graphs, which are obtained by joining a vertex of a cycle to one of the ends of a path. By means of the Coulson integral ...

A family of optimum weight spanning graph finding algorithms.
Coetzee, Floris Petrus (Stellenbosch : Stellenbosch University, 1975)