subject:(Graph)

Mississippi State University

1. Cancela, Elias Damian. Circulant digraph isomorphisms.

Degree: MS, Mathematics and Statistics, 2016, Mississippi State University

URL: http://sun.library.msstate.edu/ETD-db/theses/available/etd-04222016-140710/ ;

► We determine necessary and sufficient conditions for a Cayley digraph of the cyclic group of order n to have the property that any other… (more)

Subjects/Keywords: isomorphism; Cayley graph; CI-graph; circulant graph.

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Cancela, E. D. (2016). Circulant digraph isomorphisms. (Masters Thesis). Mississippi State University. Retrieved from http://sun.library.msstate.edu/ETD-db/theses/available/etd-04222016-140710/ ;

Chicago Manual of Style (16^th Edition):

Cancela, Elias Damian. “Circulant digraph isomorphisms.” 2016. Masters Thesis, Mississippi State University. Accessed March 07, 2021. http://sun.library.msstate.edu/ETD-db/theses/available/etd-04222016-140710/ ;.

MLA Handbook (7^th Edition):

Cancela, Elias Damian. “Circulant digraph isomorphisms.” 2016. Web. 07 Mar 2021.

Vancouver:

Cancela ED. Circulant digraph isomorphisms. [Internet] [Masters thesis]. Mississippi State University; 2016. [cited 2021 Mar 07]. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-04222016-140710/ ;.

Council of Science Editors:

Cancela ED. Circulant digraph isomorphisms. [Masters Thesis]. Mississippi State University; 2016. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-04222016-140710/ ;

Vanderbilt University

2. 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 March 07, 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. 07 Mar 2021.

Vancouver:

Solava RW. On the fine structure of graphs avoiding certain complete bipartite minors. [Internet] [Doctoral dissertation]. Vanderbilt University; 2019. [cited 2021 Mar 07]. 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 Johannesburg

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

Degree: PhD, 2012, University of Johannesburg

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

► 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 March 07, 2021. http://hdl.handle.net/10210/6158.

MLA Handbook (7^th Edition):

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

Vancouver:

Desormeaux WJ. Total domination in graphs and graph modifications. [Internet] [Doctoral dissertation]. University of Johannesburg; 2012. [cited 2021 Mar 07]. 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

4. 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 March 07, 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. 07 Mar 2021.

Vancouver:

Kroeker ME. Sparsity in Critical Graphs with Small Clique Number. [Internet] [Thesis]. University of Waterloo; 2020. [cited 2021 Mar 07]. 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

5. 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 March 07, 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. 07 Mar 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 Mar 07]. 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 Illinois – Urbana-Champaign

6. Liu, Xiyang. Graph matching by graph neural network.

Degree: MS, Electrical & Computer Engr, 2018, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/102848

► Graph matching or network alignment refers to the problem of matching two correlated graphs. This thesis presents a deep Q learning based method, which represents… (more)

Subjects/Keywords: Graph Neural Network; Graph Matching

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Liu, X. (2018). Graph matching by graph neural network. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/102848

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, Xiyang. “Graph matching by graph neural network.” 2018. Thesis, University of Illinois – Urbana-Champaign. Accessed March 07, 2021. http://hdl.handle.net/2142/102848.

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, Xiyang. “Graph matching by graph neural network.” 2018. Web. 07 Mar 2021.

Vancouver:

Liu X. Graph matching by graph neural network. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2018. [cited 2021 Mar 07]. Available from: http://hdl.handle.net/2142/102848.

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. Graph matching by graph neural network. [Thesis]. University of Illinois – Urbana-Champaign; 2018. Available from: http://hdl.handle.net/2142/102848

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

Rochester Institute of Technology

7. Culak, Juraj. Separators in High-Genus Near-Planar Graphs.

Degree: MS, Computer Science (GCCIS), 2016, Rochester Institute of Technology

URL: https://scholarworks.rit.edu/theses/9427

► Graph separators are a powerful tool that are motivated by divide and conquer algorithms on graphs. Results have shown the existence of separators in… (more)

Subjects/Keywords: Graph separators

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Culak, J. (2016). Separators in High-Genus Near-Planar Graphs. (Masters Thesis). Rochester Institute of Technology. Retrieved from https://scholarworks.rit.edu/theses/9427

Chicago Manual of Style (16^th Edition):

Culak, Juraj. “Separators in High-Genus Near-Planar Graphs.” 2016. Masters Thesis, Rochester Institute of Technology. Accessed March 07, 2021. https://scholarworks.rit.edu/theses/9427.

MLA Handbook (7^th Edition):

Culak, Juraj. “Separators in High-Genus Near-Planar Graphs.” 2016. Web. 07 Mar 2021.

Vancouver:

Culak J. Separators in High-Genus Near-Planar Graphs. [Internet] [Masters thesis]. Rochester Institute of Technology; 2016. [cited 2021 Mar 07]. Available from: https://scholarworks.rit.edu/theses/9427.

Council of Science Editors:

Culak J. Separators in High-Genus Near-Planar Graphs. [Masters Thesis]. Rochester Institute of Technology; 2016. Available from: https://scholarworks.rit.edu/theses/9427

8. Souza, Renato Ferreira de. Resolução de problemas via teoria de grafos.

Degree: Mestrado, Mestrado Profissional em Matemática em Rede Nacional, 2015, University of São Paulo

URL: http://www.teses.usp.br/teses/disponiveis/55/55136/tde-06072015-103319/ ;

►

O objetivo deste trabalho é introduzir a noção de grafos familiarizando os alunos com um conceito pouco estudado no ensino fundamental e médio. Para isso,… (more)

Subjects/Keywords: Grafos; Graph

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Souza, R. F. d. (2015). Resolução de problemas via teoria de grafos. (Masters Thesis). University of São Paulo. Retrieved from http://www.teses.usp.br/teses/disponiveis/55/55136/tde-06072015-103319/ ;

Chicago Manual of Style (16^th Edition):

Souza, Renato Ferreira de. “Resolução de problemas via teoria de grafos.” 2015. Masters Thesis, University of São Paulo. Accessed March 07, 2021. http://www.teses.usp.br/teses/disponiveis/55/55136/tde-06072015-103319/ ;.

MLA Handbook (7^th Edition):

Souza, Renato Ferreira de. “Resolução de problemas via teoria de grafos.” 2015. Web. 07 Mar 2021.

Vancouver:

Souza RFd. Resolução de problemas via teoria de grafos. [Internet] [Masters thesis]. University of São Paulo; 2015. [cited 2021 Mar 07]. Available from: http://www.teses.usp.br/teses/disponiveis/55/55136/tde-06072015-103319/ ;.

Council of Science Editors:

Souza RFd. Resolução de problemas via teoria de grafos. [Masters Thesis]. University of São Paulo; 2015. Available from: http://www.teses.usp.br/teses/disponiveis/55/55136/tde-06072015-103319/ ;

Texas A&M University

9. Xia, Xiangzhou. Efficient and Scalable Listing of Four-Vertex Subgraph.

Degree: MS, Computer Science, 2016, Texas A&M University

URL: http://hdl.handle.net/1969.1/174219

► Identifying four-vertex subgraphs has long been recognized as a fundamental technique in bioinformatics and social networks. However, listing these structures is a challenging task, especially… (more)

Subjects/Keywords: graph; motif

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Xia, X. (2016). Efficient and Scalable Listing of Four-Vertex Subgraph. (Masters Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/174219

Chicago Manual of Style (16^th Edition):

Xia, Xiangzhou. “Efficient and Scalable Listing of Four-Vertex Subgraph.” 2016. Masters Thesis, Texas A&M University. Accessed March 07, 2021. http://hdl.handle.net/1969.1/174219.

MLA Handbook (7^th Edition):

Xia, Xiangzhou. “Efficient and Scalable Listing of Four-Vertex Subgraph.” 2016. Web. 07 Mar 2021.

Vancouver:

Xia X. Efficient and Scalable Listing of Four-Vertex Subgraph. [Internet] [Masters thesis]. Texas A&M University; 2016. [cited 2021 Mar 07]. Available from: http://hdl.handle.net/1969.1/174219.

Council of Science Editors:

Xia X. Efficient and Scalable Listing of Four-Vertex Subgraph. [Masters Thesis]. Texas A&M University; 2016. Available from: http://hdl.handle.net/1969.1/174219

University of Waterloo

10. Clancy, Ryan. dstlr: Scalable Knowledge Graph Construction from Text Collections.

Degree: 2020, University of Waterloo

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

► In recent years, the amount of data being generated for consumption by enterprises has increased exponentially. Enterprises typically work with structured data, but oftentimes the… (more)

Subjects/Keywords: knowledge graph

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Clancy, R. (2020). dstlr: Scalable Knowledge Graph Construction from Text Collections. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/15739

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):

Clancy, Ryan. “dstlr: Scalable Knowledge Graph Construction from Text Collections.” 2020. Thesis, University of Waterloo. Accessed March 07, 2021. http://hdl.handle.net/10012/15739.

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

MLA Handbook (7^th Edition):

Clancy, Ryan. “dstlr: Scalable Knowledge Graph Construction from Text Collections.” 2020. Web. 07 Mar 2021.

Vancouver:

Clancy R. dstlr: Scalable Knowledge Graph Construction from Text Collections. [Internet] [Thesis]. University of Waterloo; 2020. [cited 2021 Mar 07]. Available from: http://hdl.handle.net/10012/15739.

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

Council of Science Editors:

Clancy R. dstlr: Scalable Knowledge Graph Construction from Text Collections. [Thesis]. University of Waterloo; 2020. Available from: http://hdl.handle.net/10012/15739

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

University of Waterloo

11. 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 March 07, 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. 07 Mar 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 Mar 07]. 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 Johannesburg

12. Immelman, Yolande. On the (upper) line-distinguishing and (upper) harmonious chromatic numbers of a graph.

Degree: 2009, University of Johannesburg

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

►

M.Sc.

In this dissertation we study two types of colourings, namely line-distinguishing colourings and harmonious colourings. A line-distinguishing colouring of a graph G is a… (more)

▼

M.Sc.

In this dissertation we study two types of colourings, namely line-distinguishing colourings and harmonious colourings. A line-distinguishing colouring of a graph G is a k-colouring of the vertices of G such that no two edges have the same colour. The line-distinguishing chromatic number G is defined as the smallest k such that G has a line-distinguishing k-colouring. A harmonious colouring of a graph G is a proper k-colouring of the vertices of G such that no two edges have the same colour, i.e. no two adjacent vertices can have the same colour. The harmonious chromatic number hG is defined as the smallest k such that G has a line-distinguishing k-colouring. In Chapter 0 we discuss some of the terminology and definitions used later on in our study. In Chapter 1 we introduce line-distinguishing colourings and consider the line-distinguishing chromatic number of certain familiar classes of graphs such as trees, paths, cycles and complete graphs. We also consider graphs with line-distinguishing chromatic number G equal to the usual chromatic number G, and we compare G with the chromatic index G of a graph. In Chapter 2 we mostly discuss minimal line-distinguishing (MLD) colourings. We consider minimal line-distinguishing colourings and graphs of diameter two as well as classes of regular MLD-colourable graphs. We also introduce the concept of distance regular graphs and discuss minimal line-distinguishing colourings in these graphs. In Chapter 3 we introduce a new parameter, namely the upper line-distinguishing chromatic number H G of a graph. We investigate H G for paths and cycles, and consider graphs with small upper line-distinguishing chromatic numbers. In Chapter 4 we consider the second type of colouring studied in this dissertation, namely harmonious colourings. We define the harmonious chromatic number hG and determine hG for certain classes of graphs such as paths, trees, cycles and complete graphs. In Chapter 5 we discuss upper and lower bound for hG. In Chapter 6 we discuss the upper harmonious chromatic number HG of a graph, and we determine HG for paths and cycles. We also consider graphs satisfying HG  G  1. The purpose of this study is to compile a resource which will give a thorough and well-integrated background on line-distinguishing and harmonious colourings. It is also intended to lay the groundwork for further doctoral studies in the field of colourings.

Subjects/Keywords: Graph coloring

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Immelman, Y. (2009). On the (upper) line-distinguishing and (upper) harmonious chromatic numbers of a graph. (Thesis). University of Johannesburg. Retrieved from http://hdl.handle.net/10210/2359

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):

Immelman, Yolande. “On the (upper) line-distinguishing and (upper) harmonious chromatic numbers of a graph.” 2009. Thesis, University of Johannesburg. Accessed March 07, 2021. http://hdl.handle.net/10210/2359.

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

MLA Handbook (7^th Edition):

Immelman, Yolande. “On the (upper) line-distinguishing and (upper) harmonious chromatic numbers of a graph.” 2009. Web. 07 Mar 2021.

Vancouver:

Immelman Y. On the (upper) line-distinguishing and (upper) harmonious chromatic numbers of a graph. [Internet] [Thesis]. University of Johannesburg; 2009. [cited 2021 Mar 07]. Available from: http://hdl.handle.net/10210/2359.

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

Council of Science Editors:

Immelman Y. On the (upper) line-distinguishing and (upper) harmonious chromatic numbers of a graph. [Thesis]. University of Johannesburg; 2009. Available from: http://hdl.handle.net/10210/2359

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

Wake Forest University

13. Barnett, Joel Andrew. Generalizations and Variations on Graph Pebbling.

Degree: 2014, Wake Forest University

URL: http://hdl.handle.net/10339/39310

► Graph pebbling involves determining the minimum number of pebbles needed so that regardless of the initial arrangement of pebbles on a graph, a pebble can… (more)

Subjects/Keywords: graph pebbling

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Barnett, J. A. (2014). Generalizations and Variations on Graph Pebbling. (Thesis). Wake Forest University. Retrieved from http://hdl.handle.net/10339/39310

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):

Barnett, Joel Andrew. “Generalizations and Variations on Graph Pebbling.” 2014. Thesis, Wake Forest University. Accessed March 07, 2021. http://hdl.handle.net/10339/39310.

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

MLA Handbook (7^th Edition):

Barnett, Joel Andrew. “Generalizations and Variations on Graph Pebbling.” 2014. Web. 07 Mar 2021.

Vancouver:

Barnett JA. Generalizations and Variations on Graph Pebbling. [Internet] [Thesis]. Wake Forest University; 2014. [cited 2021 Mar 07]. Available from: http://hdl.handle.net/10339/39310.

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

Council of Science Editors:

Barnett JA. Generalizations and Variations on Graph Pebbling. [Thesis]. Wake Forest University; 2014. Available from: http://hdl.handle.net/10339/39310

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

University of Newcastle

14. Wijaya, Rachel Wulan Nirmalasari. Advances in graph labelings.

Degree: MPhil, 2018, University of Newcastle

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

►

Masters Research - Master of Philosophy (MPhil)

A graph labeling is a mapping that assigns natural numbers to vertices and/or edges of a graph. In… (more)

Subjects/Keywords: graph labelings

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Wijaya, R. W. N. (2018). Advances in graph labelings. (Masters Thesis). University of Newcastle. Retrieved from http://hdl.handle.net/1959.13/1384118

Chicago Manual of Style (16^th Edition):

Wijaya, Rachel Wulan Nirmalasari. “Advances in graph labelings.” 2018. Masters Thesis, University of Newcastle. Accessed March 07, 2021. http://hdl.handle.net/1959.13/1384118.

MLA Handbook (7^th Edition):

Wijaya, Rachel Wulan Nirmalasari. “Advances in graph labelings.” 2018. Web. 07 Mar 2021.

Vancouver:

Wijaya RWN. Advances in graph labelings. [Internet] [Masters thesis]. University of Newcastle; 2018. [cited 2021 Mar 07]. Available from: http://hdl.handle.net/1959.13/1384118.

Council of Science Editors:

Wijaya RWN. Advances in graph labelings. [Masters Thesis]. University of Newcastle; 2018. Available from: http://hdl.handle.net/1959.13/1384118

University of Victoria

15. 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 March 07, 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. 07 Mar 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 Mar 07]. 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

16. Fuller, Brandon. Finding CCA groups and graphs algorithmically .

Degree: 2018, University of Lethbridge

URL: http://hdl.handle.net/10133/4996

► Given a group G, any subset C of G{e} induces a Cayley graph, Cay(G,C). The set C also induces a natural edge-colouring of this graph.… (more)

Subjects/Keywords: Cayley graph

1 more image…

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Fuller, B. (2018). Finding CCA groups and graphs algorithmically . (Thesis). University of Lethbridge. Retrieved from http://hdl.handle.net/10133/4996

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):

Fuller, Brandon. “Finding CCA groups and graphs algorithmically .” 2018. Thesis, University of Lethbridge. Accessed March 07, 2021. http://hdl.handle.net/10133/4996.

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

MLA Handbook (7^th Edition):

Fuller, Brandon. “Finding CCA groups and graphs algorithmically .” 2018. Web. 07 Mar 2021.

Vancouver:

Fuller B. Finding CCA groups and graphs algorithmically . [Internet] [Thesis]. University of Lethbridge; 2018. [cited 2021 Mar 07]. Available from: http://hdl.handle.net/10133/4996.

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

Council of Science Editors:

Fuller B. Finding CCA groups and graphs algorithmically . [Thesis]. University of Lethbridge; 2018. Available from: http://hdl.handle.net/10133/4996

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

Louisiana State University

17. 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 March 07, 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. 07 Mar 2021.

Vancouver:

D'souza KS. Excluding a Weakly 4-connected Minor. [Internet] [Doctoral dissertation]. Louisiana State University; 2016. [cited 2021 Mar 07]. 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

University of New South Wales

18. Shang, Haichuan. Efficient algorithms for graph substructure search.

Degree: Computer Science & Engineering, 2011, University of New South Wales

URL: http://handle.unsw.edu.au/1959.4/51214 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:9931/SOURCE02?view=true

► Many recent applications strongly demand efficient and effective management of graph structured data such as paths, trees, and general graphs. These applications include Bioinformatics, Chemistry,… (more)

▼ Many recent applications strongly demand efficient and effective management of graph structured data such as paths, trees, and general graphs. These applications include Bioinformatics, Chemistry, Social networks, Software and Data Engineering, World Wide Web, etc.The goal of this thesis is to investigate graph substructure search problem. Its focus is placed on enhancing efficiency in subgraph containment search and similarity search. Three subproblems are studied: (1) subgraph containment query; (2) substructure similaritysearch; and (3) similarity search on supergraph containment.For the subgraph containment query problem, efficient techniques are developed to retrieve graphs, containing a given query graph, from a large set of graphs. Most of the existing techniques based on the framework of filtering-and-verification to reduce the precise computation costs. While the existing techniques worked well for small query graphs, the verification phase became a bottleneck when the query graph size increased. Motivated by this, a novel and efficient algorithm is firstly proposed in this thesis for testing subgraph isomorphism. Secondly, a new feature-based index technique is developed to accommodate the above algorithm in the filtering phase.Substructure similarity search is to retrieve graphs that approximately contain a given query graph. It has many applications, e.g., detecting similar functions among chemical compounds. This thesis proposes a novel indexing technique, GrafD-Index, to index graphs according to their “distances” to features. Then lower and upper bounding techniques are developed to exploit the GrafD-Index to (1) prune non-promising graphs and (2) include graphs whose similarities are guaranteed to exceed the given similarity threshold. Considering that the verification phase is not well studied and plays the dominant role in the whole process, efficient algorithms are devised to verify candidates.This thesis also investigates the problem of efficiently retrieving all data graphs approximately contained by a query graph, namely similarity search on supergraph containment. A novel and efficient index is proposed to boost the efficiency of query processing. The index supports two construction strategies which aim at optimizing the performance for data distributions. Moreover, an algorithm is developed by effectively merging the indexes of individual data graphs; this not only reduces the index size but also further reduces the query processing time. Advisors/Committee Members: Lin, Xuemin, Computer Science & Engineering, Faculty of Engineering, UNSW.

Subjects/Keywords: Graph database

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Shang, H. (2011). Efficient algorithms for graph substructure search. (Doctoral Dissertation). University of New South Wales. Retrieved from http://handle.unsw.edu.au/1959.4/51214 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:9931/SOURCE02?view=true

Chicago Manual of Style (16^th Edition):

Shang, Haichuan. “Efficient algorithms for graph substructure search.” 2011. Doctoral Dissertation, University of New South Wales. Accessed March 07, 2021. http://handle.unsw.edu.au/1959.4/51214 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:9931/SOURCE02?view=true.

MLA Handbook (7^th Edition):

Shang, Haichuan. “Efficient algorithms for graph substructure search.” 2011. Web. 07 Mar 2021.

Vancouver:

Shang H. Efficient algorithms for graph substructure search. [Internet] [Doctoral dissertation]. University of New South Wales; 2011. [cited 2021 Mar 07]. Available from: http://handle.unsw.edu.au/1959.4/51214 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:9931/SOURCE02?view=true.

Council of Science Editors:

Shang H. Efficient algorithms for graph substructure search. [Doctoral Dissertation]. University of New South Wales; 2011. Available from: http://handle.unsw.edu.au/1959.4/51214 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:9931/SOURCE02?view=true

Washington State University

19. [No author]. Query-driven Exploration of Big Graphs .

Degree: 2019, Washington State University

URL: http://hdl.handle.net/2376/17891

► Exploring graph-structured data either by mining or querying is a fundamental operation that enables important applications including knowledge graph search, social network analysis, and cyber-network… (more)

▼ Exploring graph-structured data either by mining or querying is a fundamental operation that enables important applications including knowledge graph search, social network analysis, and cyber-network security. Given the proliferation of complex data in the forms of large-scale heterogeneous and dynamic graphs, it is preferable while difficult to revisit traditional query-response paradigms. Graph query construction is a daunting task and typically requires multiple iterations either due to the complexity of the schema, unfamiliarity to the data, or not having pre-determined goals. To ease the access and consumption of such rich information, there is a need to complete the existing graph-based analytical systems for exploration. In response to this requirement, the dissertation focuses on the problem of query-driven graph exploration and develops a framework to aid users in exploration of both static and dynamic graphs. Query-driven exploration allows the users to explore a fraction of the data by providing a desired but potentially incomplete analytical query (e.g. keywords, graph pattern query). It then retrieves answers to the initial query in the hope of obtaining feedback such as an updated query, examples of desired answers, or questions on why the results are not satisfactory. By focusing on interesting fraction of the data, query-driven graph exploration meets the usability and response-time requirement of real-world applications. It reduces the excessive results that may be retrieved by conventional graph mining techniques, decreases the irrelevant answers to the users' needs, and improves efficiency by e.g. local search. Hence, to support effective graph exploration with keywords as a user-friendly tool, the thesis first introduces cost-aware keyword exploratory search. Second, by proposing a class of event patterns that pertains to a set of keywords, the thesis extends exploration to the dynamic graphs. It then develops incremental algorithms to detect such patterns and the association rules among them. Finally, to aid users debugging their pattern queries by asking why the results are not satisfactory, a set of algorithms are developed. The thesis experimentally verifies the efficiency and effectiveness of the proposed approaches using real-life graphs. Advisors/Committee Members: Wu, Yinghui (advisor).

Subjects/Keywords: Computer science; Exploratory Search; Graph Database; Graph Exploration; Graph Mining; Graph Querying; Graph Streams

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

author], [. (2019). Query-driven Exploration of Big Graphs . (Thesis). Washington State University. Retrieved from http://hdl.handle.net/2376/17891

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):

author], [No. “Query-driven Exploration of Big Graphs .” 2019. Thesis, Washington State University. Accessed March 07, 2021. http://hdl.handle.net/2376/17891.

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

MLA Handbook (7^th Edition):

author], [No. “Query-driven Exploration of Big Graphs .” 2019. Web. 07 Mar 2021.

Vancouver:

author] [. Query-driven Exploration of Big Graphs . [Internet] [Thesis]. Washington State University; 2019. [cited 2021 Mar 07]. Available from: http://hdl.handle.net/2376/17891.

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

Council of Science Editors:

author] [. Query-driven Exploration of Big Graphs . [Thesis]. Washington State University; 2019. Available from: http://hdl.handle.net/2376/17891

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

Western Michigan University

20. Alhulwah, Khawlah Hamad. Structures of Derived Graphs.

Degree: PhD, Mathematics, 2017, Western Michigan University

URL: https://scholarworks.wmich.edu/dissertations/3204

► One of the most familiar derived graphs are line graphs. The line graph L(G) of a graph G is the graph whose vertices are… (more)

Subjects/Keywords: Line graph; Peterson graph; complete graph; graph; derived graphs; 3-line graph; Applied Mathematics

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Alhulwah, K. H. (2017). Structures of Derived Graphs. (Doctoral Dissertation). Western Michigan University. Retrieved from https://scholarworks.wmich.edu/dissertations/3204

Chicago Manual of Style (16^th Edition):

Alhulwah, Khawlah Hamad. “Structures of Derived Graphs.” 2017. Doctoral Dissertation, Western Michigan University. Accessed March 07, 2021. https://scholarworks.wmich.edu/dissertations/3204.

MLA Handbook (7^th Edition):

Alhulwah, Khawlah Hamad. “Structures of Derived Graphs.” 2017. Web. 07 Mar 2021.

Vancouver:

Alhulwah KH. Structures of Derived Graphs. [Internet] [Doctoral dissertation]. Western Michigan University; 2017. [cited 2021 Mar 07]. Available from: https://scholarworks.wmich.edu/dissertations/3204.

Council of Science Editors:

Alhulwah KH. Structures of Derived Graphs. [Doctoral Dissertation]. Western Michigan University; 2017. Available from: https://scholarworks.wmich.edu/dissertations/3204

Ryerson University

21. 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 March 07, 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. 07 Mar 2021.

Vancouver:

Patel S. Clique Listing Algorithms and Characteristics of Cliques in Random Graphics. [Internet] [Thesis]. Ryerson University; 2010. [cited 2021 Mar 07]. 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

Vanderbilt University

22. Schroeder, Justin Zane. Hamilton cycle embeddings of complete tripartite graphs and their applications.

Degree: PhD, Mathematics, 2012, Vanderbilt University

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

► A central problem in topological graph theory is determining the (orientable or nonorientable) genus of a given graph G. For a general graph G, this… (more)

▼ A central problem in topological graph theory is determining the (orientable or nonorientable) genus of a given graph G. For a general graph G, this problem is very difficult (in fact, it is NP-complete). Thus, it is desirable to have large families of graphs for which the genus is known. In this thesis, we use hamilton cycle embeddings of complete tripartite graphs to help determine the genera of two special families of graphs. The first family of graphs – and the original motivation for this problem – is the collection of join graphs F₁ = {K_m+G | G is an n-vertex graph and m ≥ n − 1}. The nonorientable genus for this family of graphs has been completely determined by Ellingham and Stephens. In the orientable case, they were able to determine the genus for some infinite subfamilies of F₁, but their results are not complete. In this thesis, we present a tripling construction for these embeddings that is an extension of a doubling construction employed by Ellingham and Stephens. Using this construction, together with hamilton cycle embeddings of complete tripartite graphs, we obtain the orientable genus for some additional infinite subfamilies of F₁. The second family of graphs considered is the collection of complete quadripartite graphs F₂ = {K_t,n,n,n | t ≥ 2n}. Using hamilton cycle embeddings of K_n,n,n and some surgical techniques, we determine the orientable and nonorientable genus for all members of F₂. We use two main methods to build the hamilton cycle embeddings of complete tripartite graphs that are required to obtain these results. The first method is a cyclic construction that generates the entire embedding from a sequence of edge slopes that satisfies certain conditions. Using this construction and some lifting results due to Bouchet and his collaborators, we obtain nonorientable hamilton cycle embeddings of K_n,n,n for all n ≥ 2. The second method is a construction that utilizes a connection to orthogonal latin squares that exhibit some additional structure. Using this construction – and filling in the case n = 2p for a prime p with voltage graphs – we obtain orientable hamilton cycle embeddings of K_n,n,n for all n ≠ 2. Advisors/Committee Members: Paul Edelman (committee member), C. Bruce Hughes (committee member), Michael Mihalik (committee member), Jeremy Spinrad (committee member), Mark Ellingham (Committee Chair).

Subjects/Keywords: covering triangulation; graph genus; graph embedding

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Schroeder, J. Z. (2012). Hamilton cycle embeddings of complete tripartite graphs and their applications. (Doctoral Dissertation). Vanderbilt University. Retrieved from http://hdl.handle.net/1803/10927

Chicago Manual of Style (16^th Edition):

Schroeder, Justin Zane. “Hamilton cycle embeddings of complete tripartite graphs and their applications.” 2012. Doctoral Dissertation, Vanderbilt University. Accessed March 07, 2021. http://hdl.handle.net/1803/10927.

MLA Handbook (7^th Edition):

Schroeder, Justin Zane. “Hamilton cycle embeddings of complete tripartite graphs and their applications.” 2012. Web. 07 Mar 2021.

Vancouver:

Schroeder JZ. Hamilton cycle embeddings of complete tripartite graphs and their applications. [Internet] [Doctoral dissertation]. Vanderbilt University; 2012. [cited 2021 Mar 07]. Available from: http://hdl.handle.net/1803/10927.

Council of Science Editors:

Schroeder JZ. Hamilton cycle embeddings of complete tripartite graphs and their applications. [Doctoral Dissertation]. Vanderbilt University; 2012. Available from: http://hdl.handle.net/1803/10927

University of Newcastle

23. Weaver, Natasha. A family of higher-rank graphs arising from subshifts.

Degree: PhD, 2009, University of Newcastle

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

►

Research Doctorate - Doctor of Philosophy (PhD)

There is a strong connection between directed graphs and the shifts of finite type which are an important… (more)

Subjects/Keywords: operator algebras; graph algebras; higher-rank graph

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Weaver, N. (2009). A family of higher-rank graphs arising from subshifts. (Doctoral Dissertation). University of Newcastle. Retrieved from http://hdl.handle.net/1959.13/38511

Chicago Manual of Style (16^th Edition):

Weaver, Natasha. “A family of higher-rank graphs arising from subshifts.” 2009. Doctoral Dissertation, University of Newcastle. Accessed March 07, 2021. http://hdl.handle.net/1959.13/38511.

MLA Handbook (7^th Edition):

Weaver, Natasha. “A family of higher-rank graphs arising from subshifts.” 2009. Web. 07 Mar 2021.

Vancouver:

Weaver N. A family of higher-rank graphs arising from subshifts. [Internet] [Doctoral dissertation]. University of Newcastle; 2009. [cited 2021 Mar 07]. Available from: http://hdl.handle.net/1959.13/38511.

Council of Science Editors:

Weaver N. A family of higher-rank graphs arising from subshifts. [Doctoral Dissertation]. University of Newcastle; 2009. Available from: http://hdl.handle.net/1959.13/38511

University of Newcastle

24. 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 March 07, 2021. http://hdl.handle.net/1959.13/1354312.

MLA Handbook (7^th Edition):

Tanna, Dushyant. “Graph labeling techniques.” 2017. Web. 07 Mar 2021.

Vancouver:

Tanna D. Graph labeling techniques. [Internet] [Doctoral dissertation]. University of Newcastle; 2017. [cited 2021 Mar 07]. 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

25. 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 March 07, 2021. http://hdl.handle.net/1828/11938.

MLA Handbook (7^th Edition):

Carr, MacKenzie. “Enumerating digitally convex sets in graphs.” 2020. Web. 07 Mar 2021.

Vancouver:

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

Indiana University

26. Firoz, Jesun Sahariar. Synchronization-avoiding graph algorithms and runtime aspects .

Degree: 2018, Indiana University

URL: http://hdl.handle.net/2022/22605

► Massively parallel computers provide unprecedented computing power that is only expected to grow. General-purpose Asynchronous Many-Task (AMT) runtimes exposes significant fine-grained parallelism. However, traditional Bulk-Synchronous… (more)

▼ Massively parallel computers provide unprecedented computing power that is only expected to grow. General-purpose Asynchronous Many-Task (AMT) runtimes exposes significant fine-grained parallelism. However, traditional Bulk-Synchronous Parallel (BSP) approach and variants thereof fail to utilize the full potential of AMT runtimes. In such execution model, parallel overheads may dominate execution time and hinder performance, especially in distributed memory settings. The synchronization overhead in particular is deeply rooted in the programming practice because it makes algorithms easier to design and implement. However, irregular applications such as graph algorithms can suffer performance bottlenecks due to the straggler effect induced by global and vertex-centric barriers. In the effort to eliminate barriers, we design and study unordered, data-driven graph algorithms, relying on optimistic (speculative) execution. Our design of algorithms allows work to be performed in any order, refining the result as the algorithm progresses. This flexibility in ordering facilitates parallel computation without global or vertex-centric synchronization. To avoid “wasted” work, our approach relies on local work prioritization. However, performance of such algorithms is marred by two competing trends: on one hand, there is a substantial level of parallelism, which, on the other hand, necessitates runtime support with potentially high overhead and scheduling complexity. Specifically, the global work order obtained by local prioritization is susceptible to the interference from the runtime. As such, we also investigate important runtime aspects that influence the performance of graph algorithms. In particular, we study the interaction between default runtime scheduling policies and synchronization-avoiding distributed graph algorithms. We propose plug-in scheduling policies in the application-layer for speculative graph algorithms that can provide feedback to the runtime to adjust the network progress frequency and flow of messages to the remote destinations. These techniques are useful for unordered distributed graph algorithms that necessitate a balanced interleaving of communication and computation to achieve better performance. Graph algorithms designed in different programming models have vastly different workload characteristics. In the final part of the thesis, we propose adaptivity of the runtime parameters such as message coalescing and flow control to adjust the “pressure points” in the runtime due to variable workload characteristics over the execution of an algorithm. Advisors/Committee Members: Lumsdaine, Andrew (advisor).

Subjects/Keywords: Distributed Graph Algorithms; Distributed Runtimes; Graph Algorithms

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Firoz, J. S. (2018). Synchronization-avoiding graph algorithms and runtime aspects . (Thesis). Indiana University. Retrieved from http://hdl.handle.net/2022/22605

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):

Firoz, Jesun Sahariar. “Synchronization-avoiding graph algorithms and runtime aspects .” 2018. Thesis, Indiana University. Accessed March 07, 2021. http://hdl.handle.net/2022/22605.

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

MLA Handbook (7^th Edition):

Firoz, Jesun Sahariar. “Synchronization-avoiding graph algorithms and runtime aspects .” 2018. Web. 07 Mar 2021.

Vancouver:

Firoz JS. Synchronization-avoiding graph algorithms and runtime aspects . [Internet] [Thesis]. Indiana University; 2018. [cited 2021 Mar 07]. Available from: http://hdl.handle.net/2022/22605.

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

Council of Science Editors:

Firoz JS. Synchronization-avoiding graph algorithms and runtime aspects . [Thesis]. Indiana University; 2018. Available from: http://hdl.handle.net/2022/22605

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

Australian National University

27. Hou, Yun. Control of Formations with Non-rigid and Hybrid Graphs .

Degree: 2016, Australian National University

URL: http://hdl.handle.net/1885/110870

► This thesis studies the problem of control of multi-agent formations, of which the interaction architectures can be modeled by undirected and directed graphs or a… (more)

Subjects/Keywords: formation control; graph rigidity; hybrid graph

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Hou, Y. (2016). Control of Formations with Non-rigid and Hybrid Graphs . (Thesis). Australian National University. Retrieved from http://hdl.handle.net/1885/110870

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):

Hou, Yun. “Control of Formations with Non-rigid and Hybrid Graphs .” 2016. Thesis, Australian National University. Accessed March 07, 2021. http://hdl.handle.net/1885/110870.

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

MLA Handbook (7^th Edition):

Hou, Yun. “Control of Formations with Non-rigid and Hybrid Graphs .” 2016. Web. 07 Mar 2021.

Vancouver:

Hou Y. Control of Formations with Non-rigid and Hybrid Graphs . [Internet] [Thesis]. Australian National University; 2016. [cited 2021 Mar 07]. Available from: http://hdl.handle.net/1885/110870.

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

Council of Science Editors:

Hou Y. Control of Formations with Non-rigid and Hybrid Graphs . [Thesis]. Australian National University; 2016. Available from: http://hdl.handle.net/1885/110870

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

Delft University of Technology

28. Penders, A. (author). Accelerating Graph Analysis with Heterogeneous Systems.

Degree: Software and Computer Technology, 2012, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:7f3eeb52-77bd-4fdb-84a9-ea9ca0a35b94

►

Data analysis is a rising field of interest for computer science research due to the growing amount of information that is digitally available. This increase… (more)

▼

Data analysis is a rising field of interest for computer science research due to the growing amount of information that is digitally available. This increase in data has as direct consequence that any analysis is significantly complex. By using structured representations for the data sets, like graphs, the analysis becomes feasible, but is still time-consuming. In this project, the focus is on the reduction of the computational time for data analysis, with the introduction of accelerators. Accelerators are specialized hardware components that assist the general processing unit in performing (parts of) the task at hand. In particular, we focus on the use of General Purpose Graphical Processing Units (GPGPU) to help speedup the analysis. GPUs are specifically designed for representing and manipulating graphical data which invoke the processing of large chunks of data, GPUs are designed with large numbers of concurrent processing units and thus have a high potential of improving performance. In this project, we show the impact of using GPGPUs for both simple and more complex analysis, varying from small to large data sets, with the use of a programming model called OpenCL. We compare the performance of using accelerators against the traditional CPU-based implementation. Due to the inter-platform portability of the OpenCL model, such comparison can be performed without having to alter the algorithm. The use of accelerators is expected to become beneficial for analysis that require large computational power. For example, search algorithms (that require little to no computation) are not expected to profit from accelerators, while the more complex, centrality analysis is expected to have significantly more benefit from accelerators. Our results clearly shows this shift of performance improvement when algorithms further utilize the potential of accelerators, because the analysis grows in size and/ or complexity.

Computer Engineering

Electrical Engineering, Mathematics and Computer Science

Advisors/Committee Members: Varbanescu, A.L. (mentor).

Subjects/Keywords: GPU; graph; Graph analysis; accelerators; OpenCL; parallel

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Penders, A. (. (2012). Accelerating Graph Analysis with Heterogeneous Systems. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:7f3eeb52-77bd-4fdb-84a9-ea9ca0a35b94

Chicago Manual of Style (16^th Edition):

Penders, A (author). “Accelerating Graph Analysis with Heterogeneous Systems.” 2012. Masters Thesis, Delft University of Technology. Accessed March 07, 2021. http://resolver.tudelft.nl/uuid:7f3eeb52-77bd-4fdb-84a9-ea9ca0a35b94.

MLA Handbook (7^th Edition):

Penders, A (author). “Accelerating Graph Analysis with Heterogeneous Systems.” 2012. Web. 07 Mar 2021.

Vancouver:

Penders A(. Accelerating Graph Analysis with Heterogeneous Systems. [Internet] [Masters thesis]. Delft University of Technology; 2012. [cited 2021 Mar 07]. Available from: http://resolver.tudelft.nl/uuid:7f3eeb52-77bd-4fdb-84a9-ea9ca0a35b94.

Council of Science Editors:

Penders A(. Accelerating Graph Analysis with Heterogeneous Systems. [Masters Thesis]. Delft University of Technology; 2012. Available from: http://resolver.tudelft.nl/uuid:7f3eeb52-77bd-4fdb-84a9-ea9ca0a35b94

University of Victoria

29. 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 March 07, 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. 07 Mar 2021.

Vancouver:

Manzer JDA. Chronological rectangle digraphs. [Internet] [Thesis]. University of Victoria; 2015. [cited 2021 Mar 07]. 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

30. 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 March 07, 2021. http://hdl.handle.net/1828/11404.

MLA Handbook (7^th Edition):

Bowditch, Flora Caroline. “Localized structure in graph decompositions.” 2019. Web. 07 Mar 2021.

Vancouver:

Bowditch FC. Localized structure in graph decompositions. [Internet] [Masters thesis]. University of Victoria; 2019. [cited 2021 Mar 07]. 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

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

Open Access Theses and Dissertations