Advanced search options

Advanced Search Options 🞨

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

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:( en GRAPH THEORY). Showing records 1 – 30 of 95620 total matches.

[1] [2] [3] [4] [5] … [3188]

Search Limiters

Last 2 Years | English Only

Degrees

Levels

Languages

Country

▼ Search Limiters


Pontifical Catholic University of Rio de Janeiro

1. LARISSA DA CONCEICAO BORGES DOS SANTOS. [en] GRAPH THEORY IN SECONDARY EDUCATION: A PROPOSAL.

Degree: 2018, Pontifical Catholic University of Rio de Janeiro

[pt] Este trabalho procura motivar e propor direções para uma abordagem de rudimentos da Teoria de Grafos nos anos finais da educação secundária brasileira. Os… (more)

Subjects/Keywords: [pt] ENSINO; [en] TEACHING; [pt] TEORIA DE GRAFOS; [en] GRAPH THEORY

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

SANTOS, L. D. C. B. D. (2018). [en] GRAPH THEORY IN SECONDARY EDUCATION: A PROPOSAL. (Thesis). Pontifical Catholic University of Rio de Janeiro. Retrieved from http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=33072

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

Chicago Manual of Style (16th Edition):

SANTOS, LARISSA DA CONCEICAO BORGES DOS. “[en] GRAPH THEORY IN SECONDARY EDUCATION: A PROPOSAL.” 2018. Thesis, Pontifical Catholic University of Rio de Janeiro. Accessed April 10, 2020. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=33072.

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

MLA Handbook (7th Edition):

SANTOS, LARISSA DA CONCEICAO BORGES DOS. “[en] GRAPH THEORY IN SECONDARY EDUCATION: A PROPOSAL.” 2018. Web. 10 Apr 2020.

Vancouver:

SANTOS LDCBD. [en] GRAPH THEORY IN SECONDARY EDUCATION: A PROPOSAL. [Internet] [Thesis]. Pontifical Catholic University of Rio de Janeiro; 2018. [cited 2020 Apr 10]. Available from: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=33072.

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

Council of Science Editors:

SANTOS LDCBD. [en] GRAPH THEORY IN SECONDARY EDUCATION: A PROPOSAL. [Thesis]. Pontifical Catholic University of Rio de Janeiro; 2018. Available from: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=33072

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


University of Johannesburg

2. 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)

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

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

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

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

MLA Handbook (7th Edition):

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

Vancouver:

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

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

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

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

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

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

MLA Handbook (7th Edition):

Gelling, Eric Neil. “On 1-factorizations of the complete graph and the relationship to round robin schedules.” 2016. Web. 10 Apr 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 Apr 10]. 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

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

Degree: 2016, University of Waterloo

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

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

Sullivan, Matthew. “Planar graphs without 3-cycles and with 4-cycles far apart are 3-choosable.” 2016. Thesis, University of Waterloo. Accessed April 10, 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 (7th Edition):

Sullivan, Matthew. “Planar graphs without 3-cycles and with 4-cycles far apart are 3-choosable.” 2016. Web. 10 Apr 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 Apr 10]. 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

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

Degree: PhD, Mathematics, 2019, Vanderbilt University

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

Subjects/Keywords: Graph theory; Graph minors

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

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

Solava, Ryan William. “On the fine structure of graphs avoiding certain complete bipartite minors.” 2019. Doctoral Dissertation, Vanderbilt University. Accessed April 10, 2020. http://etd.library.vanderbilt.edu/available/etd-08182019-190904/ ;.

MLA Handbook (7th Edition):

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

Vancouver:

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


Pontifical Catholic University of Rio de Janeiro

6. JOSE MAURICIO NAVA AUZA. [en] MOBILE CROWD SENSING: NEW INCENTIVE AND MOBILITY MODELS FOR REAL DEPLOYMENTS.

Degree: 2019, Pontifical Catholic University of Rio de Janeiro

[pt] A área das telecomunicações tem presenciado consideráveis avanços tecnológicos dos dispositivos móveis (e. g. telefones inteligentes, relógios inteligentes, tablets, reprodutores de música, entre outros)… (more)

Subjects/Keywords: [pt] TEORIA DOS JOGOS; [en] GAME THEORY; [pt] TEORIA DE GRAFOS; [en] GRAPH THEORY; [pt] SENSORIAMENTO COLETIVO MOVEL; [en] MOBILE CROWDSENSING; [pt] MODELO DE INCENTIVO; [en] INCENTIVE MODELS

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

AUZA, J. M. N. (2019). [en] MOBILE CROWD SENSING: NEW INCENTIVE AND MOBILITY MODELS FOR REAL DEPLOYMENTS. (Thesis). Pontifical Catholic University of Rio de Janeiro. Retrieved from http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=37531

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

Chicago Manual of Style (16th Edition):

AUZA, JOSE MAURICIO NAVA. “[en] MOBILE CROWD SENSING: NEW INCENTIVE AND MOBILITY MODELS FOR REAL DEPLOYMENTS.” 2019. Thesis, Pontifical Catholic University of Rio de Janeiro. Accessed April 10, 2020. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=37531.

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

MLA Handbook (7th Edition):

AUZA, JOSE MAURICIO NAVA. “[en] MOBILE CROWD SENSING: NEW INCENTIVE AND MOBILITY MODELS FOR REAL DEPLOYMENTS.” 2019. Web. 10 Apr 2020.

Vancouver:

AUZA JMN. [en] MOBILE CROWD SENSING: NEW INCENTIVE AND MOBILITY MODELS FOR REAL DEPLOYMENTS. [Internet] [Thesis]. Pontifical Catholic University of Rio de Janeiro; 2019. [cited 2020 Apr 10]. Available from: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=37531.

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

Council of Science Editors:

AUZA JMN. [en] MOBILE CROWD SENSING: NEW INCENTIVE AND MOBILITY MODELS FOR REAL DEPLOYMENTS. [Thesis]. Pontifical Catholic University of Rio de Janeiro; 2019. Available from: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=37531

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


Louisiana State University

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

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

  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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

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

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

MLA Handbook (7th Edition):

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

Vancouver:

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

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

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

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

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

Manzer, Joshua Daniel Adrian. “Chronological rectangle digraphs.” 2015. Thesis, University of Victoria. Accessed April 10, 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 (7th Edition):

Manzer, Joshua Daniel Adrian. “Chronological rectangle digraphs.” 2015. Web. 10 Apr 2020.

Vancouver:

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

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

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

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

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

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

MLA Handbook (7th Edition):

Bowditch, Flora Caroline. “Localized structure in graph decompositions.” 2019. Web. 10 Apr 2020.

Vancouver:

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

Council of Science Editors:

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


University of Melbourne

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

Degree: 2013, University of Melbourne

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

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

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

MLA Handbook (7th Edition):

Rotheram, Ricky. “Cores of vertex-transitive graphs.” 2013. Web. 10 Apr 2020.

Vancouver:

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


Dalhousie University

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

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

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

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

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

MLA Handbook (7th Edition):

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

Vancouver:

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

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

Degree: Mathematics, 2011, University of KwaZulu-Natal

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

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

author], [No. “Aspects of distance measures in graphs. ” 2011. Thesis, University of KwaZulu-Natal. Accessed April 10, 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 (7th Edition):

author], [No. “Aspects of distance measures in graphs. ” 2011. Web. 10 Apr 2020.

Vancouver:

author] [. Aspects of distance measures in graphs. [Internet] [Thesis]. University of KwaZulu-Natal; 2011. [cited 2020 Apr 10]. 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

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

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

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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

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

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

MLA Handbook (7th Edition):

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

Vancouver:

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

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

Degree: Mathematics, 2016, University of Manitoba

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

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

Arman, Andrii. “Maximum number of cycles in graphs and multigraphs.” 2016. Thesis, University of Manitoba. Accessed April 10, 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 (7th Edition):

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

Vancouver:

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

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

Degree: PhD, Computer Science, 2011, Rutgers University

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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

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

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

MLA Handbook (7th Edition):

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

Vancouver:

Khan, Imdadullah 1. Spanning subgraphs in graphs and hypergraphs. [Internet] [Doctoral dissertation]. Rutgers University; 2011. [cited 2020 Apr 10]. 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

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

Degree: PhD, Mathematical Sciences, 2016, Rutgers University

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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

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

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

MLA Handbook (7th Edition):

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

Vancouver:

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

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

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

  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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

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

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

MLA Handbook (7th Edition):

Acampa, Stephen. “Results on the Gold Grabbing Game.” 2018. Web. 10 Apr 2020.

Vancouver:

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

18. 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

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

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

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

MLA Handbook (7th Edition):

Berger, Amelie Julie. “Minimal reducible bounds, forbidden subgraphs and prime ideals in the lattice of additive hereditary graph properties.” 2012. Web. 10 Apr 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 Apr 10]. 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

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

Degree: MS, Mathematics, 2011, Virginia Tech

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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

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

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

MLA Handbook (7th Edition):

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

Vancouver:

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

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

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

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

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

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

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

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

MLA Handbook (7th Edition):

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

Vancouver:

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

21. Tanna, Dushyant. Graph labeling techniques.

Degree: PhD, 2017, University of Newcastle

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)

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

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

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

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

MLA Handbook (7th Edition):

Tanna, Dushyant. “Graph labeling techniques.” 2017. Web. 10 Apr 2020.

Vancouver:

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

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

Degree: 2010, Ryerson University

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

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

Patel, Sonal. “Clique Listing Algorithms and Characteristics of Cliques in Random Graphics.” 2010. Thesis, Ryerson University. Accessed April 10, 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 (7th Edition):

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

Vancouver:

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

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

Degree: 2018, University of Waterloo

 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)

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

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

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

Zhan, Hanmeng. “Discrete Quantum Walks on Graphs and Digraphs.” 2018. Thesis, University of Waterloo. Accessed April 10, 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 (7th Edition):

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

Vancouver:

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

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

Degree: 2010, University of Waterloo

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

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

Gordon, Taylor. “Simultaneously Embedding Planar Graphs at Fixed Vertex Locations.” 2010. Thesis, University of Waterloo. Accessed April 10, 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 (7th Edition):

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

Vancouver:

Gordon T. Simultaneously Embedding Planar Graphs at Fixed Vertex Locations. [Internet] [Thesis]. University of Waterloo; 2010. [cited 2020 Apr 10]. 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

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

Degree: 2011, Hong Kong University of Science and Technology

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

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

Liu, Xiaogang. “Spectral characterization and spectral estimation of some graphs.” 2011. Thesis, Hong Kong University of Science and Technology. Accessed April 10, 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 (7th Edition):

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

Vancouver:

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

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

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

  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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

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

Chicago Manual of Style (16th Edition):

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

MLA Handbook (7th Edition):

Samani, Franklina. “On Properties of rw-Regular Graphs.” 2015. Web. 10 Apr 2020.

Vancouver:

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

Council of Science Editors:

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


University of Alberta

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

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

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

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

Zhang,Xinxin. “A Model-Based Method for Content Validation of Automatically Generated Test Items.” 2016. Masters Thesis, University of Alberta. Accessed April 10, 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 (7th Edition):

Zhang,Xinxin. “A Model-Based Method for Content Validation of Automatically Generated Test Items.” 2016. Web. 10 Apr 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 Apr 10]. 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

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

Degree: 2017, University of Alaska – Fairbanks

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

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

Burr, Erika. “A study of saturation number .” 2017. Thesis, University of Alaska – Fairbanks. Accessed April 10, 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 (7th Edition):

Burr, Erika. “A study of saturation number .” 2017. Web. 10 Apr 2020.

Vancouver:

Burr E. A study of saturation number . [Internet] [Thesis]. University of Alaska – Fairbanks; 2017. [cited 2020 Apr 10]. 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

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

Degree: PhD, Pharmacy, 1985, Oregon State University

 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)

Subjects/Keywords: Graph theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

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

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

MLA Handbook (7th Edition):

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

Vancouver:

Tatong W. Molecular connectivity : an application of chemical graph theory. [Internet] [Doctoral dissertation]. Oregon State University; 1985. [cited 2020 Apr 10]. 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

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

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

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

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

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

MLA Handbook (7th Edition):

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

Vancouver:

DeCurtins JL. A comparison of methods for finding Hamiltonian circuits in graphs. [Internet] [Masters thesis]. Oregon State University; 1977. [cited 2020 Apr 10]. 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

[1] [2] [3] [4] [5] … [3188]

.