Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for +publisher:"University of Victoria" +contributor:("Mynhardt, C. M."). Showing records 1 – 10 of 10 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


University of Victoria

1. Neilson, Linda. Broadcast independence in graphs.

Degree: Department of Mathematics and Statistics, 2019, University of Victoria

 The usual graph parameters related to independent and dominating sets can be adapted to broadcasts on graphs. We examine some possible definitions for an inde-… (more)

Subjects/Keywords: Broadcasts; Graphs; Independence

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Neilson, L. (2019). Broadcast independence in graphs. (Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/11084

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Neilson, Linda. “Broadcast independence in graphs.” 2019. Thesis, University of Victoria. Accessed October 23, 2020. http://hdl.handle.net/1828/11084.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Neilson, Linda. “Broadcast independence in graphs.” 2019. Web. 23 Oct 2020.

Vancouver:

Neilson L. Broadcast independence in graphs. [Internet] [Thesis]. University of Victoria; 2019. [cited 2020 Oct 23]. Available from: http://hdl.handle.net/1828/11084.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Neilson L. Broadcast independence in graphs. [Thesis]. University of Victoria; 2019. Available from: http://hdl.handle.net/1828/11084

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Victoria

2. Lunney, Scott. Trees with equal broadcast and domination numbers.

Degree: Dept. of Mathematics and Statistics, 2011, University of Victoria

 A broadcast on a graph G=(V,E) is a function f : V → {0, ..., diam(G)} that assigns an integer value to each vertex such… (more)

Subjects/Keywords: Broadcasts in Graphs; Dominating Broadcasts

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Lunney, S. (2011). Trees with equal broadcast and domination numbers. (Masters Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/3746

Chicago Manual of Style (16th Edition):

Lunney, Scott. “Trees with equal broadcast and domination numbers.” 2011. Masters Thesis, University of Victoria. Accessed October 23, 2020. http://hdl.handle.net/1828/3746.

MLA Handbook (7th Edition):

Lunney, Scott. “Trees with equal broadcast and domination numbers.” 2011. Web. 23 Oct 2020.

Vancouver:

Lunney S. Trees with equal broadcast and domination numbers. [Internet] [Masters thesis]. University of Victoria; 2011. [cited 2020 Oct 23]. Available from: http://hdl.handle.net/1828/3746.

Council of Science Editors:

Lunney S. Trees with equal broadcast and domination numbers. [Masters Thesis]. University of Victoria; 2011. Available from: http://hdl.handle.net/1828/3746

3. Schurch, Mark. On the Depression of Graphs.

Degree: Dept. of Mathematics and Statistics, 2013, University of Victoria

 An edge ordering of a graph G = (V,E) is an injection f : E → R, where R denotes the set of real numbers.… (more)

Subjects/Keywords: graph theory; edge labellings; edge colourings

…many years at the University of Victoria. I would also like to thank Frank Ruskey for being a… 

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Schurch, M. (2013). On the Depression of Graphs. (Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/4527

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Schurch, Mark. “On the Depression of Graphs.” 2013. Thesis, University of Victoria. Accessed October 23, 2020. http://hdl.handle.net/1828/4527.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Schurch, Mark. “On the Depression of Graphs.” 2013. Web. 23 Oct 2020.

Vancouver:

Schurch M. On the Depression of Graphs. [Internet] [Thesis]. University of Victoria; 2013. [cited 2020 Oct 23]. Available from: http://hdl.handle.net/1828/4527.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Schurch M. On the Depression of Graphs. [Thesis]. University of Victoria; 2013. Available from: http://hdl.handle.net/1828/4527

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Victoria

4. Carr, MacKenzie. Enumerating digitally convex sets in graphs.

Degree: Department of Mathematics and Statistics, 2020, University of Victoria

 Given a finite set V, a convexity, C, is a collection of subsets of V that contains both the empty set and the set V… (more)

Subjects/Keywords: graph; convex; digitally convex; graph theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Carr, M. (2020). Enumerating digitally convex sets in graphs. (Masters Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/11938

Chicago Manual of Style (16th Edition):

Carr, MacKenzie. “Enumerating digitally convex sets in graphs.” 2020. Masters Thesis, University of Victoria. Accessed October 23, 2020. http://hdl.handle.net/1828/11938.

MLA Handbook (7th Edition):

Carr, MacKenzie. “Enumerating digitally convex sets in graphs.” 2020. Web. 23 Oct 2020.

Vancouver:

Carr M. Enumerating digitally convex sets in graphs. [Internet] [Masters thesis]. University of Victoria; 2020. [cited 2020 Oct 23]. Available from: http://hdl.handle.net/1828/11938.

Council of Science Editors:

Carr M. Enumerating digitally convex sets in graphs. [Masters Thesis]. University of Victoria; 2020. Available from: http://hdl.handle.net/1828/11938


University of Victoria

5. Teshima, Laura Elizabeth. Broadcasts and multipackings in graphs.

Degree: Dept. of Mathematics and Statistics, 2012, University of Victoria

 A broadcast is a function f that assigns an integer value to each vertex of a graph such that, for each v ∈ V ,… (more)

Subjects/Keywords: Graph Theory; Broadcast Domination; Multipackings; Irredundance

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Teshima, L. E. (2012). Broadcasts and multipackings in graphs. (Masters Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/4341

Chicago Manual of Style (16th Edition):

Teshima, Laura Elizabeth. “Broadcasts and multipackings in graphs.” 2012. Masters Thesis, University of Victoria. Accessed October 23, 2020. http://hdl.handle.net/1828/4341.

MLA Handbook (7th Edition):

Teshima, Laura Elizabeth. “Broadcasts and multipackings in graphs.” 2012. Web. 23 Oct 2020.

Vancouver:

Teshima LE. Broadcasts and multipackings in graphs. [Internet] [Masters thesis]. University of Victoria; 2012. [cited 2020 Oct 23]. Available from: http://hdl.handle.net/1828/4341.

Council of Science Editors:

Teshima LE. Broadcasts and multipackings in graphs. [Masters Thesis]. University of Victoria; 2012. Available from: http://hdl.handle.net/1828/4341


University of Victoria

6. Herke, Sarada Rachelle Anne. Dominating broadcasts in graphs.

Degree: Dept. of Mathematics and Statistics, 2009, University of Victoria

 A broadcast is a function f:V  →  { 0,...,diam(G)} that assigns an integer value to each vertex such that, for each v∈ V, f(v) ≤  e(v),… (more)

Subjects/Keywords: broadcast; broadcast domination; radial tree; dominating broadcast; UVic Subject Index::Sciences and Engineering::Mathematics::Pure mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Herke, S. R. A. (2009). Dominating broadcasts in graphs. (Masters Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/1479

Chicago Manual of Style (16th Edition):

Herke, Sarada Rachelle Anne. “Dominating broadcasts in graphs.” 2009. Masters Thesis, University of Victoria. Accessed October 23, 2020. http://hdl.handle.net/1828/1479.

MLA Handbook (7th Edition):

Herke, Sarada Rachelle Anne. “Dominating broadcasts in graphs.” 2009. Web. 23 Oct 2020.

Vancouver:

Herke SRA. Dominating broadcasts in graphs. [Internet] [Masters thesis]. University of Victoria; 2009. [cited 2020 Oct 23]. Available from: http://hdl.handle.net/1828/1479.

Council of Science Editors:

Herke SRA. Dominating broadcasts in graphs. [Masters Thesis]. University of Victoria; 2009. Available from: http://hdl.handle.net/1828/1479


University of Victoria

7. Schurch, Mark. Domination parameters of prisms of graphs.

Degree: Dept. of Mathematics and Statistics, 2008, University of Victoria

Subjects/Keywords: Domination (Graph theory)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Schurch, M. (2008). Domination parameters of prisms of graphs. (Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/825

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Schurch, Mark. “Domination parameters of prisms of graphs.” 2008. Thesis, University of Victoria. Accessed October 23, 2020. http://hdl.handle.net/1828/825.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Schurch, Mark. “Domination parameters of prisms of graphs.” 2008. Web. 23 Oct 2020.

Vancouver:

Schurch M. Domination parameters of prisms of graphs. [Internet] [Thesis]. University of Victoria; 2008. [cited 2020 Oct 23]. Available from: http://hdl.handle.net/1828/825.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Schurch M. Domination parameters of prisms of graphs. [Thesis]. University of Victoria; 2008. Available from: http://hdl.handle.net/1828/825

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Victoria

8. Kang, Jian. Secure paired domination in graphs.

Degree: Dept. of Mathematics and Statistics, 2010, University of Victoria

 This thesis introduces a new strategy of defending the vertices of a graph - secure paired domination, where guards are required to be paired and,… (more)

Subjects/Keywords: graphs; domination; secure; paired; UVic Subject Index::Sciences and Engineering::Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Kang, J. (2010). Secure paired domination in graphs. (Masters Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/3015

Chicago Manual of Style (16th Edition):

Kang, Jian. “Secure paired domination in graphs.” 2010. Masters Thesis, University of Victoria. Accessed October 23, 2020. http://hdl.handle.net/1828/3015.

MLA Handbook (7th Edition):

Kang, Jian. “Secure paired domination in graphs.” 2010. Web. 23 Oct 2020.

Vancouver:

Kang J. Secure paired domination in graphs. [Internet] [Masters thesis]. University of Victoria; 2010. [cited 2020 Oct 23]. Available from: http://hdl.handle.net/1828/3015.

Council of Science Editors:

Kang J. Secure paired domination in graphs. [Masters Thesis]. University of Victoria; 2010. Available from: http://hdl.handle.net/1828/3015


University of Victoria

9. Benecke, Stephen. Domination of a generalized Cartesian product.

Degree: Dept. of Mathematics and Statistics, 2009, University of Victoria

 Let G\ensuremath{\mathbin{\raisebox{0.3mm}{\scriptstyle\square}}} H denote the Cartesian product of the graphs G and H. Domination of the Cartesian product of two graphs has received much attention,… (more)

Subjects/Keywords: domination; cartesian product; generalized cartesian product; generalized prism; UVic Subject Index::Sciences and Engineering::Mathematics::Pure mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Benecke, S. (2009). Domination of a generalized Cartesian product. (Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/1493

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Benecke, Stephen. “Domination of a generalized Cartesian product.” 2009. Thesis, University of Victoria. Accessed October 23, 2020. http://hdl.handle.net/1828/1493.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Benecke, Stephen. “Domination of a generalized Cartesian product.” 2009. Web. 23 Oct 2020.

Vancouver:

Benecke S. Domination of a generalized Cartesian product. [Internet] [Thesis]. University of Victoria; 2009. [cited 2020 Oct 23]. Available from: http://hdl.handle.net/1828/1493.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Benecke S. Domination of a generalized Cartesian product. [Thesis]. University of Victoria; 2009. Available from: http://hdl.handle.net/1828/1493

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Victoria

10. Edwards, Michelle. Criticality concepts for paired domination in graphs.

Degree: Dept. of Mathematics and Statistics, 2010, University of Victoria

Subjects/Keywords: graph theory; domination; UVic Subject Index::Sciences and Engineering::Mathematics; UVic Subject Index::Sciences and Engineering::Mathematics::Mathematical statistics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Edwards, M. (2010). Criticality concepts for paired domination in graphs. (Masters Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/2122

Chicago Manual of Style (16th Edition):

Edwards, Michelle. “Criticality concepts for paired domination in graphs.” 2010. Masters Thesis, University of Victoria. Accessed October 23, 2020. http://hdl.handle.net/1828/2122.

MLA Handbook (7th Edition):

Edwards, Michelle. “Criticality concepts for paired domination in graphs.” 2010. Web. 23 Oct 2020.

Vancouver:

Edwards M. Criticality concepts for paired domination in graphs. [Internet] [Masters thesis]. University of Victoria; 2010. [cited 2020 Oct 23]. Available from: http://hdl.handle.net/1828/2122.

Council of Science Editors:

Edwards M. Criticality concepts for paired domination in graphs. [Masters Thesis]. University of Victoria; 2010. Available from: http://hdl.handle.net/1828/2122

.