subject:(Graph Theory)

University of Johannesburg

1. Desormeaux, Wyatt Jules. Total domination in graphs and graph modifications.

Degree: PhD, 2012, University of Johannesburg

► In this thesis, our primary objective is to investigate the effects that various graph modifications have on the total domination number of a graph. In… (more)

▼ In this thesis, our primary objective is to investigate the effects that various graph modifications have on the total domination number of a graph. In Chapter 1, we introduce basic graph theory concepts and preliminary definitions. In Chapters 2 and 3, we investigate the graph modification of edge removal. In Chapter 2, we characterize graphs for which the removal of any arbitrary edge increases the total domination number. We also begin the investigation of graphs for which the removal of any arbitrary edge has no effect on the total domination number. In Chapter 3, we continue this investigation and determine the minimum number of edges required for these graphs. The contents of Chapters 2 and 3 have been published in Discrete Applied Mathematics [15] and [16]. In Chapter 4, we investigate the graph modification of edge addition. In particular, we focus our attention on graphs for which adding an edge between any pair of nonadjacent vertices has no effect on the total domination number. We characterize these graphs, determine a sharp upper bound on their total domination number and determine which combinations of order and total domination number are attainable. 10 11 We also study claw-free graphs which have this property. The contents of this chapter were published in Discrete Mathematics [20]. In Chapter 5, we investigate the graph modification of vertex removal. We characterize graphs for which the removal of any vertex changes the total domination number and find sharp upper and lower bounds on the total domination number of these graphs. We also characterize graphs for which the removal of an arbitrary vertex has no effect on the total domination number and we further show that they have no forbidden subgraphs. The contents of this chapter were published in Discrete Applied Mathematics [14]. In Chapters 6 and 7, we investigate the graph modification of edge lifting. In Chapter 6, we show that there are no trees for which every possible edge lift decreases the domination number, and we characterize trees for which every possible edge lift increases the domination number. The contents of Chapter 6 were published in the journal Quaestiones Mathematicae [17]. In Chapter 7, we show that there are no trees for which every possible edge lift decreases the total domination number and that there are no trees for which every possible edge lift leaves the total domination number unchanged. We characterize trees for which every possible edge lift increases the total domination number. At the time of the writing of this thesis, the contents of Chapter 7 have been published online in the Journal of Combinatorial Optimization [18] and will appear in print in a future issue.

Subjects/Keywords: Graph theory; Domination (Graph theory)

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Desormeaux, W. J. (2012). Total domination in graphs and graph modifications. (Doctoral Dissertation). University of Johannesburg. Retrieved from http://hdl.handle.net/10210/6158

Chicago Manual of Style (16^th Edition):

Desormeaux, Wyatt Jules. “Total domination in graphs and graph modifications.” 2012. Doctoral Dissertation, University of Johannesburg. Accessed April 21, 2021. http://hdl.handle.net/10210/6158.

MLA Handbook (7^th Edition):

Desormeaux, Wyatt Jules. “Total domination in graphs and graph modifications.” 2012. Web. 21 Apr 2021.

Vancouver:

Desormeaux WJ. Total domination in graphs and graph modifications. [Internet] [Doctoral dissertation]. University of Johannesburg; 2012. [cited 2021 Apr 21]. Available from: http://hdl.handle.net/10210/6158.

Council of Science Editors:

Desormeaux WJ. Total domination in graphs and graph modifications. [Doctoral Dissertation]. University of Johannesburg; 2012. Available from: http://hdl.handle.net/10210/6158

University of Waterloo

2. de Jong, Jamie. Jaeger’s Strong 3-Flow Conjecture for Graphs in Low Genus Surfaces.

Degree: 2020, University of Waterloo

URL: http://hdl.handle.net/10012/15821

► In 1972, Tutte posed the 3-Flow Conjecture: that all 4-edge-connected graphs have a nowhere zero 3-flow. This was extended by Jaeger et al. (1992) to… (more)

Subjects/Keywords: Graph theory

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

de Jong, J. (2020). Jaeger’s Strong 3-Flow Conjecture for Graphs in Low Genus Surfaces. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/15821

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

Chicago Manual of Style (16^th Edition):

de Jong, Jamie. “Jaeger’s Strong 3-Flow Conjecture for Graphs in Low Genus Surfaces.” 2020. Thesis, University of Waterloo. Accessed April 21, 2021. http://hdl.handle.net/10012/15821.

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

MLA Handbook (7^th Edition):

de Jong, Jamie. “Jaeger’s Strong 3-Flow Conjecture for Graphs in Low Genus Surfaces.” 2020. Web. 21 Apr 2021.

Vancouver:

de Jong J. Jaeger’s Strong 3-Flow Conjecture for Graphs in Low Genus Surfaces. [Internet] [Thesis]. University of Waterloo; 2020. [cited 2021 Apr 21]. Available from: http://hdl.handle.net/10012/15821.

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

Council of Science Editors:

de Jong J. Jaeger’s Strong 3-Flow Conjecture for Graphs in Low Genus Surfaces. [Thesis]. University of Waterloo; 2020. Available from: http://hdl.handle.net/10012/15821

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

University of Victoria

3. Gelling, Eric Neil. On 1-factorizations of the complete graph and the relationship to round robin schedules.

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

URL: http://hdl.handle.net/1828/7341

► The following new results concerning 1-factorizations of the complete graph are proved: (1) There are exactly 6 equivalence classes of 1-factorizations of the complete graph… (more)

Subjects/Keywords: graph theory

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Gelling, E. N. (2016). On 1-factorizations of the complete graph and the relationship to round robin schedules. (Masters Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/7341

Chicago Manual of Style (16^th Edition):

Gelling, Eric Neil. “On 1-factorizations of the complete graph and the relationship to round robin schedules.” 2016. Masters Thesis, University of Victoria. Accessed April 21, 2021. http://hdl.handle.net/1828/7341.

MLA Handbook (7^th Edition):

Gelling, Eric Neil. “On 1-factorizations of the complete graph and the relationship to round robin schedules.” 2016. Web. 21 Apr 2021.

Vancouver:

Gelling EN. On 1-factorizations of the complete graph and the relationship to round robin schedules. [Internet] [Masters thesis]. University of Victoria; 2016. [cited 2021 Apr 21]. Available from: http://hdl.handle.net/1828/7341.

Council of Science Editors:

Gelling EN. On 1-factorizations of the complete graph and the relationship to round robin schedules. [Masters Thesis]. University of Victoria; 2016. Available from: http://hdl.handle.net/1828/7341

Vanderbilt University

4. Solava, Ryan William. On the fine structure of graphs avoiding certain complete bipartite minors.

Degree: PhD, Mathematics, 2019, Vanderbilt University

URL: http://hdl.handle.net/1803/13941

► Avoiding complete bipartite graphs as minors, and in particular K_2,t as a minor, has been used to give sufficient conditions for Hamiltonicity. For this reason… (more)

Subjects/Keywords: Graph theory; Graph minors

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Solava, R. W. (2019). On the fine structure of graphs avoiding certain complete bipartite minors. (Doctoral Dissertation). Vanderbilt University. Retrieved from http://hdl.handle.net/1803/13941

Chicago Manual of Style (16^th Edition):

Solava, Ryan William. “On the fine structure of graphs avoiding certain complete bipartite minors.” 2019. Doctoral Dissertation, Vanderbilt University. Accessed April 21, 2021. http://hdl.handle.net/1803/13941.

MLA Handbook (7^th Edition):

Solava, Ryan William. “On the fine structure of graphs avoiding certain complete bipartite minors.” 2019. Web. 21 Apr 2021.

Vancouver:

Solava RW. On the fine structure of graphs avoiding certain complete bipartite minors. [Internet] [Doctoral dissertation]. Vanderbilt University; 2019. [cited 2021 Apr 21]. Available from: http://hdl.handle.net/1803/13941.

Council of Science Editors:

Solava RW. On the fine structure of graphs avoiding certain complete bipartite minors. [Doctoral Dissertation]. Vanderbilt University; 2019. Available from: http://hdl.handle.net/1803/13941

University of Waterloo

5. Kroeker, Matthew Eliot. Sparsity in Critical Graphs with Small Clique Number.

Degree: 2020, University of Waterloo

URL: http://hdl.handle.net/10012/16178

► In 1998, Reed conjectured that for every graph G, χ(G) ≤ \lceil \frac{1}{2}(Δ(G)+1+ω(G)) \rceil, and proved that there exists ε > 0 such that χ(G)… (more)

Subjects/Keywords: graph theory; graph colouring

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Kroeker, M. E. (2020). Sparsity in Critical Graphs with Small Clique Number. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/16178

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

Chicago Manual of Style (16^th Edition):

Kroeker, Matthew Eliot. “Sparsity in Critical Graphs with Small Clique Number.” 2020. Thesis, University of Waterloo. Accessed April 21, 2021. http://hdl.handle.net/10012/16178.

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

MLA Handbook (7^th Edition):

Kroeker, Matthew Eliot. “Sparsity in Critical Graphs with Small Clique Number.” 2020. Web. 21 Apr 2021.

Vancouver:

Kroeker ME. Sparsity in Critical Graphs with Small Clique Number. [Internet] [Thesis]. University of Waterloo; 2020. [cited 2021 Apr 21]. Available from: http://hdl.handle.net/10012/16178.

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

Council of Science Editors:

Kroeker ME. Sparsity in Critical Graphs with Small Clique Number. [Thesis]. University of Waterloo; 2020. Available from: http://hdl.handle.net/10012/16178

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

University of Waterloo

6. Sullivan, Matthew. Planar graphs without 3-cycles and with 4-cycles far apart are 3-choosable.

Degree: 2016, University of Waterloo

URL: http://hdl.handle.net/10012/10859

► A graph G is said to be L-colourable if for a given list assignment L = {L(v)|v ∈ V (G)} there is a proper colouring… (more)

Subjects/Keywords: Graph Theory; Graph Colouring

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Sullivan, M. (2016). Planar graphs without 3-cycles and with 4-cycles far apart are 3-choosable. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/10859

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

Chicago Manual of Style (16^th Edition):

Sullivan, Matthew. “Planar graphs without 3-cycles and with 4-cycles far apart are 3-choosable.” 2016. Thesis, University of Waterloo. Accessed April 21, 2021. http://hdl.handle.net/10012/10859.

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

MLA Handbook (7^th Edition):

Sullivan, Matthew. “Planar graphs without 3-cycles and with 4-cycles far apart are 3-choosable.” 2016. Web. 21 Apr 2021.

Vancouver:

Sullivan M. Planar graphs without 3-cycles and with 4-cycles far apart are 3-choosable. [Internet] [Thesis]. University of Waterloo; 2016. [cited 2021 Apr 21]. Available from: http://hdl.handle.net/10012/10859.

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

Council of Science Editors:

Sullivan M. Planar graphs without 3-cycles and with 4-cycles far apart are 3-choosable. [Thesis]. University of Waterloo; 2016. Available from: http://hdl.handle.net/10012/10859

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

University of Victoria

7. Manzer, Joshua Daniel Adrian. Chronological rectangle digraphs.

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

URL: http://hdl.handle.net/1828/6989

► Interval graphs admit elegant ordering and structural characterizations. A natural digraph analogue of interval graphs, called chronological interval digraphs, has recently been identified and studied.… (more)

Subjects/Keywords: Mathematics; Combinatorics; Graph Theory; Structural Graph Theory

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Manzer, J. D. A. (2015). Chronological rectangle digraphs. (Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/6989

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

Chicago Manual of Style (16^th Edition):

Manzer, Joshua Daniel Adrian. “Chronological rectangle digraphs.” 2015. Thesis, University of Victoria. Accessed April 21, 2021. http://hdl.handle.net/1828/6989.

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

MLA Handbook (7^th Edition):

Manzer, Joshua Daniel Adrian. “Chronological rectangle digraphs.” 2015. Web. 21 Apr 2021.

Vancouver:

Manzer JDA. Chronological rectangle digraphs. [Internet] [Thesis]. University of Victoria; 2015. [cited 2021 Apr 21]. Available from: http://hdl.handle.net/1828/6989.

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

Council of Science Editors:

Manzer JDA. Chronological rectangle digraphs. [Thesis]. University of Victoria; 2015. Available from: http://hdl.handle.net/1828/6989

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

University of Victoria

8. Bowditch, Flora Caroline. Localized structure in graph decompositions.

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

URL: http://hdl.handle.net/1828/11404

► Let v ∈ Z+ and G be a simple graph. A G-decomposition of Kv is a collection F={F1,F2,...,Ft} of subgraphs of Kv such that every… (more)

Subjects/Keywords: design theory; graph theory; combinatorics; graph decompositions

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Bowditch, F. C. (2019). Localized structure in graph decompositions. (Masters Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/11404

Chicago Manual of Style (16^th Edition):

Bowditch, Flora Caroline. “Localized structure in graph decompositions.” 2019. Masters Thesis, University of Victoria. Accessed April 21, 2021. http://hdl.handle.net/1828/11404.

MLA Handbook (7^th Edition):

Bowditch, Flora Caroline. “Localized structure in graph decompositions.” 2019. Web. 21 Apr 2021.

Vancouver:

Bowditch FC. Localized structure in graph decompositions. [Internet] [Masters thesis]. University of Victoria; 2019. [cited 2021 Apr 21]. Available from: http://hdl.handle.net/1828/11404.

Council of Science Editors:

Bowditch FC. Localized structure in graph decompositions. [Masters Thesis]. University of Victoria; 2019. Available from: http://hdl.handle.net/1828/11404

University of Melbourne

9. Rotheram, Ricky. Cores of vertex-transitive graphs.

Degree: 2013, University of Melbourne

URL: http://hdl.handle.net/11343/39734

► The core of a graph Γ is the smallest graph Γ^\ast for which there exist graph homomorphisms Γ → Γ^\ast and Γ^\ast → Γ. Thus cores are fundamental to… (more)

Subjects/Keywords: repository; mathematics; graph theory; algebraic graph theory

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Rotheram, R. (2013). Cores of vertex-transitive graphs. (Masters Thesis). University of Melbourne. Retrieved from http://hdl.handle.net/11343/39734

Chicago Manual of Style (16^th Edition):

Rotheram, Ricky. “Cores of vertex-transitive graphs.” 2013. Masters Thesis, University of Melbourne. Accessed April 21, 2021. http://hdl.handle.net/11343/39734.

MLA Handbook (7^th Edition):

Rotheram, Ricky. “Cores of vertex-transitive graphs.” 2013. Web. 21 Apr 2021.

Vancouver:

Rotheram R. Cores of vertex-transitive graphs. [Internet] [Masters thesis]. University of Melbourne; 2013. [cited 2021 Apr 21]. Available from: http://hdl.handle.net/11343/39734.

Council of Science Editors:

Rotheram R. Cores of vertex-transitive graphs. [Masters Thesis]. University of Melbourne; 2013. Available from: http://hdl.handle.net/11343/39734

Louisiana State University

10. Fallon, Joshua E. Two Results in Drawing Graphs on Surfaces.

Degree: PhD, Discrete Mathematics and Combinatorics, 2018, Louisiana State University

URL: https://digitalcommons.lsu.edu/gradschool_dissertations/4611

► In this work we present results on crossing-critical graphs drawn on non-planar surfaces and results on edge-hamiltonicity of graphs on the Klein bottle. We… (more)

Subjects/Keywords: graph theory; combinatorics; topological graph theory

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Fallon, J. E. (2018). Two Results in Drawing Graphs on Surfaces. (Doctoral Dissertation). Louisiana State University. Retrieved from https://digitalcommons.lsu.edu/gradschool_dissertations/4611

Chicago Manual of Style (16^th Edition):

Fallon, Joshua E. “Two Results in Drawing Graphs on Surfaces.” 2018. Doctoral Dissertation, Louisiana State University. Accessed April 21, 2021. https://digitalcommons.lsu.edu/gradschool_dissertations/4611.

MLA Handbook (7^th Edition):

Fallon, Joshua E. “Two Results in Drawing Graphs on Surfaces.” 2018. Web. 21 Apr 2021.

Vancouver:

Fallon JE. Two Results in Drawing Graphs on Surfaces. [Internet] [Doctoral dissertation]. Louisiana State University; 2018. [cited 2021 Apr 21]. Available from: https://digitalcommons.lsu.edu/gradschool_dissertations/4611.

Council of Science Editors:

Fallon JE. Two Results in Drawing Graphs on Surfaces. [Doctoral Dissertation]. Louisiana State University; 2018. Available from: https://digitalcommons.lsu.edu/gradschool_dissertations/4611

Dalhousie University

11. Cameron, Ben. P-Generating Polynomials and the P-Fractal of a Graph.

Degree: MS, Department of Mathematics & Statistics - Math Division, 2014, Dalhousie University

URL: http://hdl.handle.net/10222/53946

► We define the P -generating polynomial for a graph G and property P as the generating polynomial for the number of P-subgraphs of G of… (more)

Subjects/Keywords: Graph theory; Polynomials

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Cameron, B. (2014). P-Generating Polynomials and the P-Fractal of a Graph. (Masters Thesis). Dalhousie University. Retrieved from http://hdl.handle.net/10222/53946

Chicago Manual of Style (16^th Edition):

Cameron, Ben. “P-Generating Polynomials and the P-Fractal of a Graph.” 2014. Masters Thesis, Dalhousie University. Accessed April 21, 2021. http://hdl.handle.net/10222/53946.

MLA Handbook (7^th Edition):

Cameron, Ben. “P-Generating Polynomials and the P-Fractal of a Graph.” 2014. Web. 21 Apr 2021.

Vancouver:

Cameron B. P-Generating Polynomials and the P-Fractal of a Graph. [Internet] [Masters thesis]. Dalhousie University; 2014. [cited 2021 Apr 21]. Available from: http://hdl.handle.net/10222/53946.

Council of Science Editors:

Cameron B. P-Generating Polynomials and the P-Fractal of a Graph. [Masters Thesis]. Dalhousie University; 2014. Available from: http://hdl.handle.net/10222/53946

University of Manitoba

12. Arman, Andrii. Maximum number of cycles in graphs and multigraphs.

Degree: Mathematics, 2016, University of Manitoba

URL: http://hdl.handle.net/1993/33030

► In this thesis a problem of determining the maximum number of cycles for the following classes of graphs is considered: triangle-free graphs; K_r-free graphs; graphs… (more)

Subjects/Keywords: Graph Theory; Cycles

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Arman, A. (2016). Maximum number of cycles in graphs and multigraphs. (Thesis). University of Manitoba. Retrieved from http://hdl.handle.net/1993/33030

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

Chicago Manual of Style (16^th Edition):

Arman, Andrii. “Maximum number of cycles in graphs and multigraphs.” 2016. Thesis, University of Manitoba. Accessed April 21, 2021. http://hdl.handle.net/1993/33030.

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

MLA Handbook (7^th Edition):

Arman, Andrii. “Maximum number of cycles in graphs and multigraphs.” 2016. Web. 21 Apr 2021.

Vancouver:

Arman A. Maximum number of cycles in graphs and multigraphs. [Internet] [Thesis]. University of Manitoba; 2016. [cited 2021 Apr 21]. Available from: http://hdl.handle.net/1993/33030.

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

Council of Science Editors:

Arman A. Maximum number of cycles in graphs and multigraphs. [Thesis]. University of Manitoba; 2016. Available from: http://hdl.handle.net/1993/33030

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

13. Acampa, Stephen. Results on the Gold Grabbing Game.

Degree: MS, Mathematics and Statistics, 2018, Encompass Digital Archive, Eastern Kentucky University

URL: https://encompass.eku.edu/etd/500

► In this paper, we will contribute to research on a Graph Theory problem known as the Gold Grabbing Game. The game consists of two… (more)

Subjects/Keywords: Graph Theory; Mathematics

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Acampa, S. (2018). Results on the Gold Grabbing Game. (Masters Thesis). Encompass Digital Archive, Eastern Kentucky University. Retrieved from https://encompass.eku.edu/etd/500

Chicago Manual of Style (16^th Edition):

Acampa, Stephen. “Results on the Gold Grabbing Game.” 2018. Masters Thesis, Encompass Digital Archive, Eastern Kentucky University. Accessed April 21, 2021. https://encompass.eku.edu/etd/500.

MLA Handbook (7^th Edition):

Acampa, Stephen. “Results on the Gold Grabbing Game.” 2018. Web. 21 Apr 2021.

Vancouver:

Acampa S. Results on the Gold Grabbing Game. [Internet] [Masters thesis]. Encompass Digital Archive, Eastern Kentucky University; 2018. [cited 2021 Apr 21]. Available from: https://encompass.eku.edu/etd/500.

Council of Science Editors:

Acampa S. Results on the Gold Grabbing Game. [Masters Thesis]. Encompass Digital Archive, Eastern Kentucky University; 2018. Available from: https://encompass.eku.edu/etd/500

Utah State University

14. Andersen, Aaron. GraphShop: An Interactive Software Environment for Graph Theory Research and Applications.

Degree: MS, Mathematics and Statistics, 2011, Utah State University

URL: https://digitalcommons.usu.edu/etd/896

► Graph Theory is the mathematical study of the structure of abstract relationships between objects. Although these constructions (graphs) are themselves purely theoretical, their ability… (more)

Subjects/Keywords: Graph Theory; Mathematics

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Andersen, A. (2011). GraphShop: An Interactive Software Environment for Graph Theory Research and Applications. (Masters Thesis). Utah State University. Retrieved from https://digitalcommons.usu.edu/etd/896

Chicago Manual of Style (16^th Edition):

Andersen, Aaron. “GraphShop: An Interactive Software Environment for Graph Theory Research and Applications.” 2011. Masters Thesis, Utah State University. Accessed April 21, 2021. https://digitalcommons.usu.edu/etd/896.

MLA Handbook (7^th Edition):

Andersen, Aaron. “GraphShop: An Interactive Software Environment for Graph Theory Research and Applications.” 2011. Web. 21 Apr 2021.

Vancouver:

Andersen A. GraphShop: An Interactive Software Environment for Graph Theory Research and Applications. [Internet] [Masters thesis]. Utah State University; 2011. [cited 2021 Apr 21]. Available from: https://digitalcommons.usu.edu/etd/896.

Council of Science Editors:

Andersen A. GraphShop: An Interactive Software Environment for Graph Theory Research and Applications. [Masters Thesis]. Utah State University; 2011. Available from: https://digitalcommons.usu.edu/etd/896

Rutgers University

15. Wang, Pei, 1987-. Relative Rips machine and thin type components of band complexes.

Degree: PhD, Mathematical Sciences, 2016, Rutgers University

URL: https://rucore.libraries.rutgers.edu/rutgers-lib/50574/

►

The Rips machine is a method of studying the action of groups on real trees. Roughly speaking, the Rips machine is an algorithm that takes… (more)

Subjects/Keywords: Trees (Graph theory)

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Wang, Pei, 1. (2016). Relative Rips machine and thin type components of band complexes. (Doctoral Dissertation). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/50574/

Chicago Manual of Style (16^th Edition):

Wang, Pei, 1987-. “Relative Rips machine and thin type components of band complexes.” 2016. Doctoral Dissertation, Rutgers University. Accessed April 21, 2021. https://rucore.libraries.rutgers.edu/rutgers-lib/50574/.

MLA Handbook (7^th Edition):

Wang, Pei, 1987-. “Relative Rips machine and thin type components of band complexes.” 2016. Web. 21 Apr 2021.

Vancouver:

Wang, Pei 1. Relative Rips machine and thin type components of band complexes. [Internet] [Doctoral dissertation]. Rutgers University; 2016. [cited 2021 Apr 21]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/50574/.

Council of Science Editors:

Wang, Pei 1. Relative Rips machine and thin type components of band complexes. [Doctoral Dissertation]. Rutgers University; 2016. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/50574/

University of Johannesburg

16. Berger, Amelie Julie. Minimal reducible bounds, forbidden subgraphs and prime ideals in the lattice of additive hereditary graph properties.

Degree: PhD, 2012, University of Johannesburg

URL: http://hdl.handle.net/10210/4277

► After giving basic definitions concerning additive hereditary properties of graphs, this document is divided into three main sections, concerning minimal reducible bounds, minimal forbidden subgraphs… (more)

Subjects/Keywords: Graph theory; Lattice theory

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Berger, A. J. (2012). Minimal reducible bounds, forbidden subgraphs and prime ideals in the lattice of additive hereditary graph properties. (Doctoral Dissertation). University of Johannesburg. Retrieved from http://hdl.handle.net/10210/4277

Chicago Manual of Style (16^th Edition):

Berger, Amelie Julie. “Minimal reducible bounds, forbidden subgraphs and prime ideals in the lattice of additive hereditary graph properties.” 2012. Doctoral Dissertation, University of Johannesburg. Accessed April 21, 2021. http://hdl.handle.net/10210/4277.

MLA Handbook (7^th Edition):

Berger, Amelie Julie. “Minimal reducible bounds, forbidden subgraphs and prime ideals in the lattice of additive hereditary graph properties.” 2012. Web. 21 Apr 2021.

Vancouver:

Berger AJ. Minimal reducible bounds, forbidden subgraphs and prime ideals in the lattice of additive hereditary graph properties. [Internet] [Doctoral dissertation]. University of Johannesburg; 2012. [cited 2021 Apr 21]. Available from: http://hdl.handle.net/10210/4277.

Council of Science Editors:

Berger AJ. Minimal reducible bounds, forbidden subgraphs and prime ideals in the lattice of additive hereditary graph properties. [Doctoral Dissertation]. University of Johannesburg; 2012. Available from: http://hdl.handle.net/10210/4277

Virginia Tech

17. Dickson, James Odziemiec. An Introduction to Ramsey Theory on Graphs.

Degree: MS, Mathematics, 2011, Virginia Tech

URL: http://hdl.handle.net/10919/32873

This thesis is written as a single source introduction to Ramsey Theory for advanced undergraduates and graduate students. Advisors/Committee Members: Brown, Ezra A. (committeechair), Klaus, Martin (committee member), Loehr, Nicholas A. (committee member), Shimozono, Mark M. (committee member).

Subjects/Keywords: Combinatorics; Graph Theory; Ramsey Theory

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Dickson, J. O. (2011). An Introduction to Ramsey Theory on Graphs. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/32873

Chicago Manual of Style (16^th Edition):

Dickson, James Odziemiec. “An Introduction to Ramsey Theory on Graphs.” 2011. Masters Thesis, Virginia Tech. Accessed April 21, 2021. http://hdl.handle.net/10919/32873.

MLA Handbook (7^th Edition):

Dickson, James Odziemiec. “An Introduction to Ramsey Theory on Graphs.” 2011. Web. 21 Apr 2021.

Vancouver:

Dickson JO. An Introduction to Ramsey Theory on Graphs. [Internet] [Masters thesis]. Virginia Tech; 2011. [cited 2021 Apr 21]. Available from: http://hdl.handle.net/10919/32873.

Council of Science Editors:

Dickson JO. An Introduction to Ramsey Theory on Graphs. [Masters Thesis]. Virginia Tech; 2011. Available from: http://hdl.handle.net/10919/32873

Louisiana State University

18. D'souza, Kimberly Sevin. Excluding a Weakly 4-connected Minor.

Degree: PhD, Applied Mathematics, 2016, Louisiana State University

URL: etd-04042016-220803 ; https://digitalcommons.lsu.edu/gradschool_dissertations/1368

► A 3-connected graph G is called weakly 4-connected if min (|E(G₁)|, |E(G₂)|) ≤ 4 holds for all 3-separations (G₁,G₂) of G. A 3-connected graph G… (more)

Subjects/Keywords: graph theory; graph minors; graph decomposition; Pyramid graph

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

D'souza, K. S. (2016). Excluding a Weakly 4-connected Minor. (Doctoral Dissertation). Louisiana State University. Retrieved from etd-04042016-220803 ; https://digitalcommons.lsu.edu/gradschool_dissertations/1368

Chicago Manual of Style (16^th Edition):

D'souza, Kimberly Sevin. “Excluding a Weakly 4-connected Minor.” 2016. Doctoral Dissertation, Louisiana State University. Accessed April 21, 2021. etd-04042016-220803 ; https://digitalcommons.lsu.edu/gradschool_dissertations/1368.

MLA Handbook (7^th Edition):

D'souza, Kimberly Sevin. “Excluding a Weakly 4-connected Minor.” 2016. Web. 21 Apr 2021.

Vancouver:

D'souza KS. Excluding a Weakly 4-connected Minor. [Internet] [Doctoral dissertation]. Louisiana State University; 2016. [cited 2021 Apr 21]. Available from: etd-04042016-220803 ; https://digitalcommons.lsu.edu/gradschool_dissertations/1368.

Council of Science Editors:

D'souza KS. Excluding a Weakly 4-connected Minor. [Doctoral Dissertation]. Louisiana State University; 2016. Available from: etd-04042016-220803 ; https://digitalcommons.lsu.edu/gradschool_dissertations/1368

Ryerson University

19. Patel, Sonal. Clique Listing Algorithms and Characteristics of Cliques in Random Graphics.

Degree: 2010, Ryerson University

URL: https://digital.library.ryerson.ca/islandora/object/RULA%3A1845

► In this thesis we address three main problems in clique detection in the area of Graph Theory. i) Most of current methods for clique detection… (more)

Subjects/Keywords: Random graphs; Graph theory; Algorithms; Graph algorithms

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Patel, S. (2010). Clique Listing Algorithms and Characteristics of Cliques in Random Graphics. (Thesis). Ryerson University. Retrieved from https://digital.library.ryerson.ca/islandora/object/RULA%3A1845

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

Chicago Manual of Style (16^th Edition):

Patel, Sonal. “Clique Listing Algorithms and Characteristics of Cliques in Random Graphics.” 2010. Thesis, Ryerson University. Accessed April 21, 2021. https://digital.library.ryerson.ca/islandora/object/RULA%3A1845.

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

MLA Handbook (7^th Edition):

Patel, Sonal. “Clique Listing Algorithms and Characteristics of Cliques in Random Graphics.” 2010. Web. 21 Apr 2021.

Vancouver:

Patel S. Clique Listing Algorithms and Characteristics of Cliques in Random Graphics. [Internet] [Thesis]. Ryerson University; 2010. [cited 2021 Apr 21]. Available from: https://digital.library.ryerson.ca/islandora/object/RULA%3A1845.

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

Council of Science Editors:

Patel S. Clique Listing Algorithms and Characteristics of Cliques in Random Graphics. [Thesis]. Ryerson University; 2010. Available from: https://digital.library.ryerson.ca/islandora/object/RULA%3A1845

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

University of Newcastle

20. Tanna, Dushyant. Graph labeling techniques.

Degree: PhD, 2017, University of Newcastle

URL: http://hdl.handle.net/1959.13/1354312

►

Research Doctorate - Doctor of Philosophy (PhD)

We give some background to the labeling schemes like graceful, harmonious, magic, antimagic and irregular total labelings. Followed… (more)

▼

Research Doctorate - Doctor of Philosophy (PhD)

We give some background to the labeling schemes like graceful, harmonious, magic, antimagic and irregular total labelings. Followed by this we give some preliminary results and open problems in these schemes. We will introduce a new branch of irregular total labeling, irregular reflexive labeling. This new labeling technique has few variations on vertices labels from irregular total labeling. They are, 1) The vertices labels are non negative even integers. 2) The vertex label 0 is permissible, representing the vertex without loop. The vertex (edge) irregular reflexive labeling is a total irregular labeling with above conditions on vertices labeling such that the vertices (edges) weights are distinct. The idea is to use minimum possible labels for vertices (edges) and thus keeping the reflexive vertex (edge) strength as low as possible. We believe that this new technique is closer in concept to the original irregular labeling as proposed by Chartrand et al., since the vertex labels are also being used to represent edges(loops). Again the objective is to minimize the total strength by using the smallest vertices/edges labels. We will give edge and vertex irregular reflexive strengths for many graphs such as paths, cycles, stars, complete graphs, prisms, wheels, baskets, friendship graphs, join of graphs and generalised friendship graphs and present labeling techniques for these graphs. We also describe edge covering, H-edge covering, H-magic and H-antimagic graphs and prove some theorems based on these concepts. Many results have been established for construction of H-antimagic labelings of graphs. We will use the partitions of a set of integers with determined differences, the upper bound of the difference d if the graph G^H is super (a,d)-H-antimagic, establishment of connection between H-antimagic labelings and edge-antimagic total labelings. We have also posed some open problems. Finally we address why study of graph labeling is important by explaining some applications of graph labeling and give some open problems and conjectures.

Advisors/Committee Members: University of Newcastle. Faculty of Science & Information Technology, School of Mathematical and Physical Sciences.

Subjects/Keywords: graph theory; vertices; graph labeling; combinatorics

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Tanna, D. (2017). Graph labeling techniques. (Doctoral Dissertation). University of Newcastle. Retrieved from http://hdl.handle.net/1959.13/1354312

Chicago Manual of Style (16^th Edition):

Tanna, Dushyant. “Graph labeling techniques.” 2017. Doctoral Dissertation, University of Newcastle. Accessed April 21, 2021. http://hdl.handle.net/1959.13/1354312.

MLA Handbook (7^th Edition):

Tanna, Dushyant. “Graph labeling techniques.” 2017. Web. 21 Apr 2021.

Vancouver:

Tanna D. Graph labeling techniques. [Internet] [Doctoral dissertation]. University of Newcastle; 2017. [cited 2021 Apr 21]. Available from: http://hdl.handle.net/1959.13/1354312.

Council of Science Editors:

Tanna D. Graph labeling techniques. [Doctoral Dissertation]. University of Newcastle; 2017. Available from: http://hdl.handle.net/1959.13/1354312

University of Victoria

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

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

URL: http://hdl.handle.net/1828/11938

► 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 Details Similar Records Cite « Share

❌

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

APA (6^th 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 (16^th Edition):

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

MLA Handbook (7^th Edition):

Carr, MacKenzie. “Enumerating digitally convex sets in graphs.” 2020. Web. 21 Apr 2021.

Vancouver:

Carr M. Enumerating digitally convex sets in graphs. [Internet] [Masters thesis]. University of Victoria; 2020. [cited 2021 Apr 21]. 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

22. Zhan, Hanmeng. Discrete Quantum Walks on Graphs and Digraphs.

Degree: 2018, University of Waterloo

URL: http://hdl.handle.net/10012/13952

► This thesis studies various models of discrete quantum walks on graphs and digraphs via a spectral approach. A discrete quantum walk on a digraph X… (more)

▼ This thesis studies various models of discrete quantum walks on graphs and digraphs via a spectral approach. A discrete quantum walk on a digraph X is determined by a unitary matrix U, which acts on complex functions of the arcs of X. Generally speaking, U is a product of two sparse unitary matrices, based on two direct-sum decompositions of the state space. Our goal is to relate properties of the walk to properties of X, given some of these decompositions. We start by exploring two models that involve coin operators, one due to Kendon, and the other due to Aharonov, Ambainis, Kempe, and Vazirani. While U is not defined as a function in the adjacency matrix of the graph X, we find exact spectral correspondence between U and X. This leads to characterization of rare phenomena, such as perfect state transfer and uniform average vertex mixing, in terms of the eigenvalues and eigenvectors of X. We also construct infinite families of graphs and digraphs that admit the aforementioned phenomena. The second part of this thesis analyzes abstract quantum walks, with no extra assumption on U. We show that knowing the spectral decomposition of U leads to better understanding of the time-averaged limit of the probability distribution. In particular, we derive three upper bounds on the mixing time, and characterize different forms of uniform limiting distribution, using the spectral information of U. Finally, we construct a new model of discrete quantum walks from orientable embeddings of graphs. We show that the behavior of this walk largely depends on the vertex-face incidence structure. Circular embeddings of regular graphs for which U has few eigenvalues are characterized. For instance, if U has exactly three eigenvalues, then the vertex-face incidence structure is a symmetric 2-design, and U is the exponential of a scalar multiple of the skew-symmetric adjacency matrix of an oriented graph. We prove that, for every regular embedding of a complete graph, U is the transition matrix of a continuous quantum walk on an oriented graph.

Subjects/Keywords: algebraic graph theory; quantum walks; graph embeddings

5 more images…

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Zhan, H. (2018). Discrete Quantum Walks on Graphs and Digraphs. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/13952

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

Chicago Manual of Style (16^th Edition):

Zhan, Hanmeng. “Discrete Quantum Walks on Graphs and Digraphs.” 2018. Thesis, University of Waterloo. Accessed April 21, 2021. http://hdl.handle.net/10012/13952.

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

MLA Handbook (7^th Edition):

Zhan, Hanmeng. “Discrete Quantum Walks on Graphs and Digraphs.” 2018. Web. 21 Apr 2021.

Vancouver:

Zhan H. Discrete Quantum Walks on Graphs and Digraphs. [Internet] [Thesis]. University of Waterloo; 2018. [cited 2021 Apr 21]. Available from: http://hdl.handle.net/10012/13952.

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

Council of Science Editors:

Zhan H. Discrete Quantum Walks on Graphs and Digraphs. [Thesis]. University of Waterloo; 2018. Available from: http://hdl.handle.net/10012/13952

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

Hong Kong University of Science and Technology

23. Liu, Xiaogang. Spectral characterization and spectral estimation of some graphs.

Degree: 2011, Hong Kong University of Science and Technology

URL: http://repository.ust.hk/ir/Record/1783.1-7091 ; https://doi.org/10.14711/thesis-b1129753 ; http://repository.ust.hk/ir/bitstream/1783.1-7091/1/th_redirect.html

► This thesis studies two subjects. One is the spectral characterization problem, the other is the spectral estimation probelm. For the former, we mainly investigate the… (more)

Subjects/Keywords: Graph theory ; Spectral theory (Mathematics) ; Estimation theory

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Liu, X. (2011). Spectral characterization and spectral estimation of some graphs. (Thesis). Hong Kong University of Science and Technology. Retrieved from http://repository.ust.hk/ir/Record/1783.1-7091 ; https://doi.org/10.14711/thesis-b1129753 ; http://repository.ust.hk/ir/bitstream/1783.1-7091/1/th_redirect.html

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

Chicago Manual of Style (16^th Edition):

Liu, Xiaogang. “Spectral characterization and spectral estimation of some graphs.” 2011. Thesis, Hong Kong University of Science and Technology. Accessed April 21, 2021. http://repository.ust.hk/ir/Record/1783.1-7091 ; https://doi.org/10.14711/thesis-b1129753 ; http://repository.ust.hk/ir/bitstream/1783.1-7091/1/th_redirect.html.

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

MLA Handbook (7^th Edition):

Liu, Xiaogang. “Spectral characterization and spectral estimation of some graphs.” 2011. Web. 21 Apr 2021.

Vancouver:

Liu X. Spectral characterization and spectral estimation of some graphs. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2011. [cited 2021 Apr 21]. Available from: http://repository.ust.hk/ir/Record/1783.1-7091 ; https://doi.org/10.14711/thesis-b1129753 ; http://repository.ust.hk/ir/bitstream/1783.1-7091/1/th_redirect.html.

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

Council of Science Editors:

Liu X. Spectral characterization and spectral estimation of some graphs. [Thesis]. Hong Kong University of Science and Technology; 2011. Available from: http://repository.ust.hk/ir/Record/1783.1-7091 ; https://doi.org/10.14711/thesis-b1129753 ; http://repository.ust.hk/ir/bitstream/1783.1-7091/1/th_redirect.html

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

Colorado State University

24. Lindzey, Nathan. Faster graph algorithms via switching classes.

Degree: MS(M.S.), Computer Science, 2012, Colorado State University

URL: http://hdl.handle.net/10217/68126

► The runtime of an algorithm is intimately related to how an instance is represented. Recall that the runtimes of the first generation of graph algorithms… (more)

Subjects/Keywords: algorithms; dense graphs; graph compression; graph representation; graph theory; switching

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Lindzey, N. (2012). Faster graph algorithms via switching classes. (Masters Thesis). Colorado State University. Retrieved from http://hdl.handle.net/10217/68126

Chicago Manual of Style (16^th Edition):

Lindzey, Nathan. “Faster graph algorithms via switching classes.” 2012. Masters Thesis, Colorado State University. Accessed April 21, 2021. http://hdl.handle.net/10217/68126.

MLA Handbook (7^th Edition):

Lindzey, Nathan. “Faster graph algorithms via switching classes.” 2012. Web. 21 Apr 2021.

Vancouver:

Lindzey N. Faster graph algorithms via switching classes. [Internet] [Masters thesis]. Colorado State University; 2012. [cited 2021 Apr 21]. Available from: http://hdl.handle.net/10217/68126.

Council of Science Editors:

Lindzey N. Faster graph algorithms via switching classes. [Masters Thesis]. Colorado State University; 2012. Available from: http://hdl.handle.net/10217/68126

Virginia Tech

25. Chen, Zhiqian. Graph Neural Networks: Techniques and Applications.

Degree: PhD, Computer Science and Applications, 2020, Virginia Tech

URL: http://hdl.handle.net/10919/99848

► Graph data is pervasive throughout most fields, including pandemic spread network, social network, transportation roads, internet, and chemical structure. Therefore, the applications modeled by graph… (more)

▼ Graph data is pervasive throughout most fields, including pandemic spread network, social network, transportation roads, internet, and chemical structure. Therefore, the applications modeled by graph benefit people's everyday life, and graph mining derives insightful opinions from this complex topology. This paper investigates an emerging technique called graph neural newton (GNNs), which is designed for graph data mining. There are two primary goals of this thesis paper: (1) understanding the GNNs in theory, and (2) apply GNNs for unexplored and values real-world scenarios. For the first goal, we investigate spectral theory and approximation theory, and a unified framework is proposed to summarize most GNNs. This direction provides a possibility that existing or newly proposed works can be compared, and the actual process can be measured. Specifically, this result demonstrates that most GNNs are either an approximation for a function of graph adjacency matrix or a function of eigenvalues. Different types of approximations are analyzed in terms of physical meaning, and the advantages and disadvantages are offered. Beyond that, we proposed a new optimization for a highly accurate but low efficient approximation. Evaluation of synthetic data proves its theoretical power, and the tests on two transportation networks show its potentials in real-world graphs. For the second goal, the circuit is selected as a novel application since it is crucial, but there are few works. Specifically, we focus on a security problem, a high-value real-world problem in industry companies such as Nvidia, Apple, AMD, etc. This problem is defined as a circuit graph as apply GNN to learn the representation regarding the prediction target such as attach runtime. Experiment on several benchmark circuits shows its superiority on effectiveness and efficacy compared with competitive baselines. This paper provides exploration in theory and application with GNNs, which shows a promising direction for graph mining tasks. Its potentials also provide a wide range of innovations in graph-based problems. Advisors/Committee Members: Lu, Chang Tien (committeechair), Chen, Feng (committee member), Chen, Ing Ray (committee member), Ramakrishnan, Naren (committee member), Haghighat, Alireza (committee member).

Subjects/Keywords: graph neural network; graph mining; approximation theory; spectral graph; circuit deobfuscation

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Chen, Z. (2020). Graph Neural Networks: Techniques and Applications. (Doctoral Dissertation). Virginia Tech. Retrieved from http://hdl.handle.net/10919/99848

Chicago Manual of Style (16^th Edition):

Chen, Zhiqian. “Graph Neural Networks: Techniques and Applications.” 2020. Doctoral Dissertation, Virginia Tech. Accessed April 21, 2021. http://hdl.handle.net/10919/99848.

MLA Handbook (7^th Edition):

Chen, Zhiqian. “Graph Neural Networks: Techniques and Applications.” 2020. Web. 21 Apr 2021.

Vancouver:

Chen Z. Graph Neural Networks: Techniques and Applications. [Internet] [Doctoral dissertation]. Virginia Tech; 2020. [cited 2021 Apr 21]. Available from: http://hdl.handle.net/10919/99848.

Council of Science Editors:

Chen Z. Graph Neural Networks: Techniques and Applications. [Doctoral Dissertation]. Virginia Tech; 2020. Available from: http://hdl.handle.net/10919/99848

East Tennessee State University

26. Samani, Franklina. On Properties of r_w-Regular Graphs.

Degree: MS, Mathematical Sciences, 2015, East Tennessee State University

URL: https://dc.etsu.edu/etd/2601

► If every vertex in a graph G has the same degree, then the graph is called a regular graph. That is, if deg(v) =… (more)

Subjects/Keywords: graph theory; weighted graph; aw-regular graph.; Mathematics

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Samani, F. (2015). On Properties of r_w-Regular Graphs. (Thesis). East Tennessee State University. Retrieved from https://dc.etsu.edu/etd/2601

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

Chicago Manual of Style (16^th Edition):

Samani, Franklina. “On Properties of r_w-Regular Graphs.” 2015. Thesis, East Tennessee State University. Accessed April 21, 2021. https://dc.etsu.edu/etd/2601.

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

MLA Handbook (7^th Edition):

Samani, Franklina. “On Properties of r_w-Regular Graphs.” 2015. Web. 21 Apr 2021.

Vancouver:

Samani F. On Properties of r_w-Regular Graphs. [Internet] [Thesis]. East Tennessee State University; 2015. [cited 2021 Apr 21]. Available from: https://dc.etsu.edu/etd/2601.

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

Council of Science Editors:

Samani F. On Properties of r_w-Regular Graphs. [Thesis]. East Tennessee State University; 2015. Available from: https://dc.etsu.edu/etd/2601

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

Bowling Green State University

27. Adams, Sarah E. Chromatic Polynomials for Graphs with Split Vertices.

Degree: MA, Mathematics/Mathematics (Pure), 2020, Bowling Green State University

URL: http://rave.ohiolink.edu/etdc/view?acc_num=bgsu1593819941367146

► Graph theory is a branch of mathematics that uses graphs as a mathematical structure to model relations between objects. Graphs can be categorized in a… (more)

Subjects/Keywords: Mathematics; chromatic polynomials; graph theory; graph coloring; fractional coloring; graph coloring

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Adams, S. E. (2020). Chromatic Polynomials for Graphs with Split Vertices. (Masters Thesis). Bowling Green State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=bgsu1593819941367146

Chicago Manual of Style (16^th Edition):

Adams, Sarah E. “Chromatic Polynomials for Graphs with Split Vertices.” 2020. Masters Thesis, Bowling Green State University. Accessed April 21, 2021. http://rave.ohiolink.edu/etdc/view?acc_num=bgsu1593819941367146.

MLA Handbook (7^th Edition):

Adams, Sarah E. “Chromatic Polynomials for Graphs with Split Vertices.” 2020. Web. 21 Apr 2021.

Vancouver:

Adams SE. Chromatic Polynomials for Graphs with Split Vertices. [Internet] [Masters thesis]. Bowling Green State University; 2020. [cited 2021 Apr 21]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=bgsu1593819941367146.

Council of Science Editors:

Adams SE. Chromatic Polynomials for Graphs with Split Vertices. [Masters Thesis]. Bowling Green State University; 2020. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=bgsu1593819941367146

University of California – San Diego

28. Cummings, Jonathan James. Flips and Juggles.

Degree: Mathematics, 2016, University of California – San Diego

URL: http://www.escholarship.org/uc/item/4vn913nb

► In this dissertation we study juggling card sequences and edge flipping in graphs, as well as some related problems. Juggling patterns can be described by… (more)

Subjects/Keywords: Mathematics; Combinatorics; Graph Theory

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Cummings, J. J. (2016). Flips and Juggles. (Thesis). University of California – San Diego. Retrieved from http://www.escholarship.org/uc/item/4vn913nb

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

Chicago Manual of Style (16^th Edition):

Cummings, Jonathan James. “Flips and Juggles.” 2016. Thesis, University of California – San Diego. Accessed April 21, 2021. http://www.escholarship.org/uc/item/4vn913nb.

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

MLA Handbook (7^th Edition):

Cummings, Jonathan James. “Flips and Juggles.” 2016. Web. 21 Apr 2021.

Vancouver:

Cummings JJ. Flips and Juggles. [Internet] [Thesis]. University of California – San Diego; 2016. [cited 2021 Apr 21]. Available from: http://www.escholarship.org/uc/item/4vn913nb.

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

Council of Science Editors:

Cummings JJ. Flips and Juggles. [Thesis]. University of California – San Diego; 2016. Available from: http://www.escholarship.org/uc/item/4vn913nb

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

University of Hong Kong

29. 羅家豪. Some results in graph theory.

Degree: 2010, University of Hong Kong

URL: http://hdl.handle.net/10722/130929

Subjects/Keywords: Graph theory.

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

羅家豪.. (2010). Some results in graph theory. (Thesis). University of Hong Kong. Retrieved from http://hdl.handle.net/10722/130929

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

Chicago Manual of Style (16^th Edition):

羅家豪.. “Some results in graph theory.” 2010. Thesis, University of Hong Kong. Accessed April 21, 2021. http://hdl.handle.net/10722/130929.

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

MLA Handbook (7^th Edition):

羅家豪.. “Some results in graph theory.” 2010. Web. 21 Apr 2021.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Vancouver:

羅家豪.. Some results in graph theory. [Internet] [Thesis]. University of Hong Kong; 2010. [cited 2021 Apr 21]. Available from: http://hdl.handle.net/10722/130929.

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

Council of Science Editors:

羅家豪.. Some results in graph theory. [Thesis]. University of Hong Kong; 2010. Available from: http://hdl.handle.net/10722/130929

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

University of Alberta

30. Zhang,Xinxin. A Model-Based Method for Content Validation of Automatically Generated Test Items.

Degree: MEd, Department of Educational Psychology, 2016, University of Alberta

URL: https://era.library.ualberta.ca/files/c8w32r576x

► The purpose of this study is to describe a methodology to recover the model (cognitive and item models) from generated test items using a novel… (more)

Subjects/Keywords: AIG; graph theory; cognitive model

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Zhang,Xinxin. (2016). A Model-Based Method for Content Validation of Automatically Generated Test Items. (Masters Thesis). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/c8w32r576x

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Chicago Manual of Style (16^th Edition):

Zhang,Xinxin. “A Model-Based Method for Content Validation of Automatically Generated Test Items.” 2016. Masters Thesis, University of Alberta. Accessed April 21, 2021. https://era.library.ualberta.ca/files/c8w32r576x.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

MLA Handbook (7^th Edition):

Zhang,Xinxin. “A Model-Based Method for Content Validation of Automatically Generated Test Items.” 2016. Web. 21 Apr 2021.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Vancouver:

Zhang,Xinxin. A Model-Based Method for Content Validation of Automatically Generated Test Items. [Internet] [Masters thesis]. University of Alberta; 2016. [cited 2021 Apr 21]. Available from: https://era.library.ualberta.ca/files/c8w32r576x.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Council of Science Editors:

Zhang,Xinxin. A Model-Based Method for Content Validation of Automatically Generated Test Items. [Masters Thesis]. University of Alberta; 2016. Available from: https://era.library.ualberta.ca/files/c8w32r576x

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

		in
And / Or
		in
And / Or
		in
And / Or
		in

Open Access Theses and Dissertations