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 March 28, 2020. http://hdl.handle.net/10210/6158.

MLA Handbook (7^th Edition):

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

Vancouver:

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

2. 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 28, 2020. 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. 28 Mar 2020.

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 2020 Mar 28]. 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

University of Waterloo

3. 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 28, 2020. 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. 28 Mar 2020.

Vancouver:

Sullivan M. Planar graphs without 3-cycles and with 4-cycles far apart are 3-choosable. [Internet] [Thesis]. University of Waterloo; 2016. [cited 2020 Mar 28]. 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

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://etd.library.vanderbilt.edu/available/etd-08182019-190904/ ;

► 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://etd.library.vanderbilt.edu/available/etd-08182019-190904/ ;

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 28, 2020. http://etd.library.vanderbilt.edu/available/etd-08182019-190904/ ;.

MLA Handbook (7^th Edition):

Solava, Ryan William. “On the fine structure of graphs avoiding certain complete bipartite minors.” 2019. Web. 28 Mar 2020.

Vancouver:

Solava RW. On the fine structure of graphs avoiding certain complete bipartite minors. [Internet] [Doctoral dissertation]. Vanderbilt University; 2019. [cited 2020 Mar 28]. Available from: http://etd.library.vanderbilt.edu/available/etd-08182019-190904/ ;.

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://etd.library.vanderbilt.edu/available/etd-08182019-190904/ ;

Louisiana State University

5. 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 March 28, 2020. https://digitalcommons.lsu.edu/gradschool_dissertations/4611.

MLA Handbook (7^th Edition):

Fallon, Joshua E. “Two Results in Drawing Graphs on Surfaces.” 2018. Web. 28 Mar 2020.

Vancouver:

Fallon JE. Two Results in Drawing Graphs on Surfaces. [Internet] [Doctoral dissertation]. Louisiana State University; 2018. [cited 2020 Mar 28]. 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

University of Victoria

6. 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 28, 2020. 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. 28 Mar 2020.

Vancouver:

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

7. 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 March 28, 2020. http://hdl.handle.net/11343/39734.

MLA Handbook (7^th Edition):

Rotheram, Ricky. “Cores of vertex-transitive graphs.” 2013. Web. 28 Mar 2020.

Vancouver:

Rotheram R. Cores of vertex-transitive graphs. [Internet] [Masters thesis]. University of Melbourne; 2013. [cited 2020 Mar 28]. 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

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 March 28, 2020. http://hdl.handle.net/1828/11404.

MLA Handbook (7^th Edition):

Bowditch, Flora Caroline. “Localized structure in graph decompositions.” 2019. Web. 28 Mar 2020.

Vancouver:

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

Dalhousie University

9. 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 March 28, 2020. 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. 28 Mar 2020.

Vancouver:

Cameron B. P-Generating Polynomials and the P-Fractal of a Graph. [Internet] [Masters thesis]. Dalhousie University; 2014. [cited 2020 Mar 28]. 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 KwaZulu-Natal

10. [No author]. Aspects of distance measures in graphs.

Degree: Mathematics, 2011, University of KwaZulu-Natal

URL: http://hdl.handle.net/10413/9841

► In this thesis we investigate bounds on distance measures, namely, Steiner diameter and radius, in terms of other graph parameters. The thesis consists of four… (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):

author], [. (2011). Aspects of distance measures in graphs. (Thesis). University of KwaZulu-Natal. Retrieved from http://hdl.handle.net/10413/9841

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. “Aspects of distance measures in graphs. ” 2011. Thesis, University of KwaZulu-Natal. Accessed March 28, 2020. http://hdl.handle.net/10413/9841.

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. “Aspects of distance measures in graphs. ” 2011. Web. 28 Mar 2020.

Vancouver:

author] [. Aspects of distance measures in graphs. [Internet] [Thesis]. University of KwaZulu-Natal; 2011. [cited 2020 Mar 28]. Available from: http://hdl.handle.net/10413/9841.

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

Council of Science Editors:

author] [. Aspects of distance measures in graphs. [Thesis]. University of KwaZulu-Natal; 2011. Available from: http://hdl.handle.net/10413/9841

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

Utah State University

11. 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 March 28, 2020. 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. 28 Mar 2020.

Vancouver:

Andersen A. GraphShop: An Interactive Software Environment for Graph Theory Research and Applications. [Internet] [Masters thesis]. Utah State University; 2011. [cited 2020 Mar 28]. 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

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 March 28, 2020. 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. 28 Mar 2020.

Vancouver:

Arman A. Maximum number of cycles in graphs and multigraphs. [Internet] [Thesis]. University of Manitoba; 2016. [cited 2020 Mar 28]. 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

Rutgers University

13. Khan, Imdadullah, 1980-. Spanning subgraphs in graphs and hypergraphs.

Degree: PhD, Computer Science, 2011, Rutgers University

URL: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000061299

►

This thesis consists of three new fundamental results on the existence of spanning subgraphs in graphs and hypergraphs. Cycle Factors in Graphs: A classical conjecture… (more)

Subjects/Keywords: Graph theory; Hypergraphs

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Khan, Imdadullah, 1. (2011). Spanning subgraphs in graphs and hypergraphs. (Doctoral Dissertation). Rutgers University. Retrieved from http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000061299

Chicago Manual of Style (16^th Edition):

Khan, Imdadullah, 1980-. “Spanning subgraphs in graphs and hypergraphs.” 2011. Doctoral Dissertation, Rutgers University. Accessed March 28, 2020. http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000061299.

MLA Handbook (7^th Edition):

Khan, Imdadullah, 1980-. “Spanning subgraphs in graphs and hypergraphs.” 2011. Web. 28 Mar 2020.

Vancouver:

Khan, Imdadullah 1. Spanning subgraphs in graphs and hypergraphs. [Internet] [Doctoral dissertation]. Rutgers University; 2011. [cited 2020 Mar 28]. Available from: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000061299.

Council of Science Editors:

Khan, Imdadullah 1. Spanning subgraphs in graphs and hypergraphs. [Doctoral Dissertation]. Rutgers University; 2011. Available from: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000061299

Rutgers University

14. 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 March 28, 2020. 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. 28 Mar 2020.

Vancouver:

Wang, Pei 1. Relative Rips machine and thin type components of band complexes. [Internet] [Doctoral dissertation]. Rutgers University; 2016. [cited 2020 Mar 28]. 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/

15. 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 March 28, 2020. https://encompass.eku.edu/etd/500.

MLA Handbook (7^th Edition):

Acampa, Stephen. “Results on the Gold Grabbing Game.” 2018. Web. 28 Mar 2020.

Vancouver:

Acampa S. Results on the Gold Grabbing Game. [Internet] [Masters thesis]. Encompass Digital Archive, Eastern Kentucky University; 2018. [cited 2020 Mar 28]. 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

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 March 28, 2020. 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. 28 Mar 2020.

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 2020 Mar 28]. 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 March 28, 2020. http://hdl.handle.net/10919/32873.

MLA Handbook (7^th Edition):

Dickson, James Odziemiec. “An Introduction to Ramsey Theory on Graphs.” 2011. Web. 28 Mar 2020.

Vancouver:

Dickson JO. An Introduction to Ramsey Theory on Graphs. [Internet] [Masters thesis]. Virginia Tech; 2011. [cited 2020 Mar 28]. 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 March 28, 2020. 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. 28 Mar 2020.

Vancouver:

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

19. 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 28, 2020. http://hdl.handle.net/1959.13/1354312.

MLA Handbook (7^th Edition):

Tanna, Dushyant. “Graph labeling techniques.” 2017. Web. 28 Mar 2020.

Vancouver:

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

Ryerson University

20. 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 28, 2020. 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. 28 Mar 2020.

Vancouver:

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

21. 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 March 28, 2020. 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. 28 Mar 2020.

Vancouver:

Zhan H. Discrete Quantum Walks on Graphs and Digraphs. [Internet] [Thesis]. University of Waterloo; 2018. [cited 2020 Mar 28]. 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

University of Waterloo

22. Gordon, Taylor. Simultaneously Embedding Planar Graphs at Fixed Vertex Locations.

Degree: 2010, University of Waterloo

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

► We discuss the problem of embedding planar graphs onto the plane with pre-specified vertex locations. In particular, we introduce a method for constructing such an… (more)

Subjects/Keywords: Graph Drawing; Simultaneous Embeddings; Graph Theory

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Gordon, T. (2010). Simultaneously Embedding Planar Graphs at Fixed Vertex Locations. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/5174

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

Gordon, Taylor. “Simultaneously Embedding Planar Graphs at Fixed Vertex Locations.” 2010. Thesis, University of Waterloo. Accessed March 28, 2020. http://hdl.handle.net/10012/5174.

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

MLA Handbook (7^th Edition):

Gordon, Taylor. “Simultaneously Embedding Planar Graphs at Fixed Vertex Locations.” 2010. Web. 28 Mar 2020.

Vancouver:

Gordon T. Simultaneously Embedding Planar Graphs at Fixed Vertex Locations. [Internet] [Thesis]. University of Waterloo; 2010. [cited 2020 Mar 28]. Available from: http://hdl.handle.net/10012/5174.

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

Council of Science Editors:

Gordon T. Simultaneously Embedding Planar Graphs at Fixed Vertex Locations. [Thesis]. University of Waterloo; 2010. Available from: http://hdl.handle.net/10012/5174

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 March 28, 2020. 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. 28 Mar 2020.

Vancouver:

Liu X. Spectral characterization and spectral estimation of some graphs. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2011. [cited 2020 Mar 28]. 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

East Tennessee State University

24. 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. (Masters Thesis). East Tennessee State University. Retrieved from https://dc.etsu.edu/etd/2601

Chicago Manual of Style (16^th Edition):

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

MLA Handbook (7^th Edition):

Samani, Franklina. “On Properties of r_w-Regular Graphs.” 2015. Web. 28 Mar 2020.

Vancouver:

Samani F. On Properties of r_w-Regular Graphs. [Internet] [Masters thesis]. East Tennessee State University; 2015. [cited 2020 Mar 28]. Available from: https://dc.etsu.edu/etd/2601.

Council of Science Editors:

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

University of Alberta

25. 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 March 28, 2020. 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. 28 Mar 2020.

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 2020 Mar 28]. 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

University of Alaska – Fairbanks

26. Burr, Erika. A study of saturation number .

Degree: 2017, University of Alaska – Fairbanks

URL: http://hdl.handle.net/11122/7864

► This paper seeks to provide complete proofs in modern notation of (early) key saturation number results and give some new results concerning the semi-saturation number.… (more)

Subjects/Keywords: Extremal problems (Mathematics); Graph theory

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Burr, E. (2017). A study of saturation number . (Thesis). University of Alaska – Fairbanks. Retrieved from http://hdl.handle.net/11122/7864

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

Burr, Erika. “A study of saturation number .” 2017. Thesis, University of Alaska – Fairbanks. Accessed March 28, 2020. http://hdl.handle.net/11122/7864.

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

MLA Handbook (7^th Edition):

Burr, Erika. “A study of saturation number .” 2017. Web. 28 Mar 2020.

Vancouver:

Burr E. A study of saturation number . [Internet] [Thesis]. University of Alaska – Fairbanks; 2017. [cited 2020 Mar 28]. Available from: http://hdl.handle.net/11122/7864.

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

Council of Science Editors:

Burr E. A study of saturation number . [Thesis]. University of Alaska – Fairbanks; 2017. Available from: http://hdl.handle.net/11122/7864

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

Oregon State University

27. Tatong, Walapa. Molecular connectivity : an application of chemical graph theory.

Degree: PhD, Pharmacy, 1985, Oregon State University

URL: http://hdl.handle.net/1957/40862

► Molecular connectivity is a topological descriptor of a molecule. It has been used as an independent variable to describe biological activities, physicochemical parameters (melting points,… (more)

▼ Molecular connectivity is a topological descriptor of a molecule. It has been used as an independent variable to describe biological activities, physicochemical parameters (melting points, boiling points, partition coefficients) and chromatographic retention indices. There are inherent problems in using molecular connectivity. A zero connectivity term has two opposing meanings: 1) The connectivity term does not exist in a specific molecule and 2) The molecule is approaching infinite connectivity. This thesis is divided into four parts. Part I describes a study in which two methods of calculating molecular connectivity indices were evaluated. These were the traditional reciprocal square root and nontraditional approach. In each case, two involving biological responses and a third using connectivity to predict octanol-water partition coefficients, the molecular connectivity indices calculated by the traditional reciprocal square root method yielded superior results. This method of calculating indices was used for parts II IV of this thesis. Part II describes a study correlating molecular connectivity indices with gas chromatographic retention indices (Kovats indices) on two sets of compounds, 144 saturated aliphatic hydrocarbons and 53 monounsaturated hydrocarbons. Using subsets from both populations of hydrocarbons, it was shown that the actual regression models using connectivity indices as independent variables are dependent on the particular compounds used to construct the regression equation. Part III compares the relative usefulness of partition coefficients and first order molecular connectivity indices in predicting gas chromatographic retention indices. In general both are equally effective. Both approaches are incapable of distinguishing between sets of alkane isomers with differing branching positions, alkene isomers with differing locations of double bonds, and cis and trans alkene isomers. Part IV examines the relationship of molecular connectivity with extrapolated R[subscript M] and log k' values in liquid chromatography of two sets of phenolic compounds. While good correlations were obtained, it was shown again that the choice of significant molecular connectivity indices is dependent on the particular set of compounds being evaluated. Advisors/Committee Members: Block, John H. (advisor).

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

Tatong, W. (1985). Molecular connectivity : an application of chemical graph theory. (Doctoral Dissertation). Oregon State University. Retrieved from http://hdl.handle.net/1957/40862

Chicago Manual of Style (16^th Edition):

Tatong, Walapa. “Molecular connectivity : an application of chemical graph theory.” 1985. Doctoral Dissertation, Oregon State University. Accessed March 28, 2020. http://hdl.handle.net/1957/40862.

MLA Handbook (7^th Edition):

Tatong, Walapa. “Molecular connectivity : an application of chemical graph theory.” 1985. Web. 28 Mar 2020.

Vancouver:

Tatong W. Molecular connectivity : an application of chemical graph theory. [Internet] [Doctoral dissertation]. Oregon State University; 1985. [cited 2020 Mar 28]. Available from: http://hdl.handle.net/1957/40862.

Council of Science Editors:

Tatong W. Molecular connectivity : an application of chemical graph theory. [Doctoral Dissertation]. Oregon State University; 1985. Available from: http://hdl.handle.net/1957/40862

Oregon State University

28. DeCurtins, Jeffrey Lee. A comparison of methods for finding Hamiltonian circuits in graphs.

Degree: MS, Computer Science, 1977, Oregon State University

URL: http://hdl.handle.net/1957/43184

► This paper compares three classes of algorithms for finding Hamiltonian circuits in graphs. Two of the classes are exhaustive search procedures and this study finds… (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):

DeCurtins, J. L. (1977). A comparison of methods for finding Hamiltonian circuits in graphs. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/43184

Chicago Manual of Style (16^th Edition):

DeCurtins, Jeffrey Lee. “A comparison of methods for finding Hamiltonian circuits in graphs.” 1977. Masters Thesis, Oregon State University. Accessed March 28, 2020. http://hdl.handle.net/1957/43184.

MLA Handbook (7^th Edition):

DeCurtins, Jeffrey Lee. “A comparison of methods for finding Hamiltonian circuits in graphs.” 1977. Web. 28 Mar 2020.

Vancouver:

DeCurtins JL. A comparison of methods for finding Hamiltonian circuits in graphs. [Internet] [Masters thesis]. Oregon State University; 1977. [cited 2020 Mar 28]. Available from: http://hdl.handle.net/1957/43184.

Council of Science Editors:

DeCurtins JL. A comparison of methods for finding Hamiltonian circuits in graphs. [Masters Thesis]. Oregon State University; 1977. Available from: http://hdl.handle.net/1957/43184

University of Hong Kong

29. Sang, Jiajun. Min-max relations on two packing problems.

Degree: PhD, 2017, University of Hong Kong

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

►

Min-max relations appear widely among various combinatorial optimization problems. Packing problems also have an essential position among all topics of graph theory. This thesis aims… (more)

▼

Min-max relations appear widely among various combinatorial optimization problems. Packing problems also have an essential position among all topics of graph theory. This thesis aims at investigating two different kinds of packing problems which reflect the min-max relation under certain circumstances. The fractional edge cover packing problem comes from the integer edge cover packing problem which is originally a dual problem of the edge coloring problem. The seagulls packing problem is the simplest of all F-packing problems excluding maximum matching problem. Our first main result is that the fractional edge cover packing problems can be handled in strong polynomial time for any loopless multigraph with three or more vertices. Also the maximum number of edge covers in a fractional packing will not exceed m+3n-1 while n and m are the size of vertices and edges of the given graph. The total weight of a maximum fractional edge cover packing is the fractional cover index ξ^*(G)=\min {δ(G), Φ(G)}, where δ(G) is the minimum degree of G and Φ(G)=\min {\frac{2|E⁺(U)|}{|U|+1}: U\subseteq V, |U| ≥ 3 { and \ odd}} (E⁺(U) is the set of edges in G with at least one end in U). We give a detailed algorithm for finding such a packing and estimate the complexity of it. Our second result shows that the maximum packing number of seagulls equals to the minimum covering number of seagulls for any weight function defined on vertices in certain graphs without specific forbidden structures. A similar result for edge weighted seagulls packing also holds with respect to a different set of forbidden structures. We further extend the previous two results and find out two more classes of graphs whose all subgraphs enjoy the same min-max properties as the original graphs have (one class for vertex weighted graphs and another for edge weighted graphs). Detailed forbidden structures of all these classes of graphs together with their proofs are given in the main body of this thesis.

published_or_final_version

Mathematics

Doctoral

Doctor of Philosophy

Advisors/Committee Members: Zang, W.

Subjects/Keywords: Graph theory; Combinatorial optimization

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Sang, J. (2017). Min-max relations on two packing problems. (Doctoral Dissertation). University of Hong Kong. Retrieved from http://hdl.handle.net/10722/249866

Chicago Manual of Style (16^th Edition):

Sang, Jiajun. “Min-max relations on two packing problems.” 2017. Doctoral Dissertation, University of Hong Kong. Accessed March 28, 2020. http://hdl.handle.net/10722/249866.

MLA Handbook (7^th Edition):

Sang, Jiajun. “Min-max relations on two packing problems.” 2017. Web. 28 Mar 2020.

Vancouver:

Sang J. Min-max relations on two packing problems. [Internet] [Doctoral dissertation]. University of Hong Kong; 2017. [cited 2020 Mar 28]. Available from: http://hdl.handle.net/10722/249866.

Council of Science Editors:

Sang J. Min-max relations on two packing problems. [Doctoral Dissertation]. University of Hong Kong; 2017. Available from: http://hdl.handle.net/10722/249866

University of Hong Kong

30. Chen, Xujin. Graph partitions and integer flows.

Degree: PhD, 2004, University of Hong Kong

URL: Chen, X. [陳旭瑾]. (2004). Graph partitions and integer flows. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b3028625 ; http://dx.doi.org/10.5353/th_b3028625 ; http://hdl.handle.net/10722/32145

abstract

toc

published_or_final_version

Mathematics

Doctoral

Doctor of Philosophy

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

Chen, X. (2004). Graph partitions and integer flows. (Doctoral Dissertation). University of Hong Kong. Retrieved from Chen, X. [陳旭瑾]. (2004). Graph partitions and integer flows. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b3028625 ; http://dx.doi.org/10.5353/th_b3028625 ; http://hdl.handle.net/10722/32145

Chicago Manual of Style (16^th Edition):

Chen, Xujin. “Graph partitions and integer flows.” 2004. Doctoral Dissertation, University of Hong Kong. Accessed March 28, 2020. Chen, X. [陳旭瑾]. (2004). Graph partitions and integer flows. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b3028625 ; http://dx.doi.org/10.5353/th_b3028625 ; http://hdl.handle.net/10722/32145.

MLA Handbook (7^th Edition):

Chen, Xujin. “Graph partitions and integer flows.” 2004. Web. 28 Mar 2020.

Vancouver:

Chen X. Graph partitions and integer flows. [Internet] [Doctoral dissertation]. University of Hong Kong; 2004. [cited 2020 Mar 28]. Available from: Chen, X. [陳旭瑾]. (2004). Graph partitions and integer flows. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b3028625 ; http://dx.doi.org/10.5353/th_b3028625 ; http://hdl.handle.net/10722/32145.

Council of Science Editors:

Chen X. Graph partitions and integer flows. [Doctoral Dissertation]. University of Hong Kong; 2004. Available from: Chen, X. [陳旭瑾]. (2004). Graph partitions and integer flows. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b3028625 ; http://dx.doi.org/10.5353/th_b3028625 ; http://hdl.handle.net/10722/32145

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

Open Access Theses and Dissertations