Advanced search options

Sorted by: relevance · author · university · date | New search

You searched for `subject:(Discrete Mathematics AND Combinatorics)`

.
Showing records 1 – 30 of
383 total matches.

◁ [1] [2] [3] [4] [5] … [13] ▶

Search Limiters

Dates

- 2015 – 2019 (166)
- 2010 – 2014 (139)
- 2005 – 2009 (67)
- 2000 – 2004 (19)
- 1995 – 1999 (10)

Universities

- East Tennessee State University (48)
- University of Canterbury (32)
- University of Kentucky (21)
- ETH Zürich (16)
- Georgia Southern University (14)
- University of Oxford (13)
- Western Kentucky University (13)
- University of Waterloo (10)

Department

- Mathematics (75)
- Mathematical Sciences (58)
- Department of Mathematical Sciences (21)
- Department of Mathematics (14)

Degrees

- MS (89)
- PhD (81)
- MSin Mathematics (M.S.) (14)

Country

- US (259)
- New Zealand (32)
- Canada (30)
- UK (18)
- Switzerland (16)

▼ Search Limiters

UCLA

1. Miner, Samuel Alexander. Limit Shapes of Restricted Permutations.

Degree: Mathematics, 2015, UCLA

URL: http://www.escholarship.org/uc/item/2zr5v8vb

► Following the techniques initiated in , we continue to study the limit shapes of random permutations avoiding a specific subset of patterns. We consider patterns…
(more)

Subjects/Keywords: Mathematics; combinatorics; discrete mathematics; mathematics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Miner, S. A. (2015). Limit Shapes of Restricted Permutations. (Thesis). UCLA. Retrieved from http://www.escholarship.org/uc/item/2zr5v8vb

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

Miner, Samuel Alexander. “Limit Shapes of Restricted Permutations.” 2015. Thesis, UCLA. Accessed October 16, 2019. http://www.escholarship.org/uc/item/2zr5v8vb.

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Miner, Samuel Alexander. “Limit Shapes of Restricted Permutations.” 2015. Web. 16 Oct 2019.

Vancouver:

Miner SA. Limit Shapes of Restricted Permutations. [Internet] [Thesis]. UCLA; 2015. [cited 2019 Oct 16]. Available from: http://www.escholarship.org/uc/item/2zr5v8vb.

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Miner SA. Limit Shapes of Restricted Permutations. [Thesis]. UCLA; 2015. Available from: http://www.escholarship.org/uc/item/2zr5v8vb

Not specified: Masters Thesis or Doctoral Dissertation

University of Nevada – Las Vegas

2. Hansen, Samuel M. Zero-sum magic graphs and their null sets.

Degree: MSin Mathematical Science, Mathematical Sciences, 2011, University of Nevada – Las Vegas

URL: https://digitalscholarship.unlv.edu/thesesdissertations/1010

► For any element h of the Natural numbers, a graph G=(V,E), with vertex set V and edge set E, is said to be h-magic…
(more)

Subjects/Keywords: Discrete Mathematics and Combinatorics; Mathematics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Hansen, S. M. (2011). Zero-sum magic graphs and their null sets. (Masters Thesis). University of Nevada – Las Vegas. Retrieved from https://digitalscholarship.unlv.edu/thesesdissertations/1010

Chicago Manual of Style (16^{th} Edition):

Hansen, Samuel M. “Zero-sum magic graphs and their null sets.” 2011. Masters Thesis, University of Nevada – Las Vegas. Accessed October 16, 2019. https://digitalscholarship.unlv.edu/thesesdissertations/1010.

MLA Handbook (7^{th} Edition):

Hansen, Samuel M. “Zero-sum magic graphs and their null sets.” 2011. Web. 16 Oct 2019.

Vancouver:

Hansen SM. Zero-sum magic graphs and their null sets. [Internet] [Masters thesis]. University of Nevada – Las Vegas; 2011. [cited 2019 Oct 16]. Available from: https://digitalscholarship.unlv.edu/thesesdissertations/1010.

Council of Science Editors:

Hansen SM. Zero-sum magic graphs and their null sets. [Masters Thesis]. University of Nevada – Las Vegas; 2011. Available from: https://digitalscholarship.unlv.edu/thesesdissertations/1010

Temple University

3. Dobbins, Michael Gene. Representations of Polytopes.

Degree: PhD, 2011, Temple University

URL: http://digital.library.temple.edu/u?/p245801coll10,141523

►

*Mathematics*

Here we investigate a variety of ways to represent polytopes and related objects. We define a class of posets, which includes all abstract polytopes,… (more)

Subjects/Keywords: Mathematics; Combinatorics; Discrete Geometry

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Dobbins, M. G. (2011). Representations of Polytopes. (Doctoral Dissertation). Temple University. Retrieved from http://digital.library.temple.edu/u?/p245801coll10,141523

Chicago Manual of Style (16^{th} Edition):

Dobbins, Michael Gene. “Representations of Polytopes.” 2011. Doctoral Dissertation, Temple University. Accessed October 16, 2019. http://digital.library.temple.edu/u?/p245801coll10,141523.

MLA Handbook (7^{th} Edition):

Dobbins, Michael Gene. “Representations of Polytopes.” 2011. Web. 16 Oct 2019.

Vancouver:

Dobbins MG. Representations of Polytopes. [Internet] [Doctoral dissertation]. Temple University; 2011. [cited 2019 Oct 16]. Available from: http://digital.library.temple.edu/u?/p245801coll10,141523.

Council of Science Editors:

Dobbins MG. Representations of Polytopes. [Doctoral Dissertation]. Temple University; 2011. Available from: http://digital.library.temple.edu/u?/p245801coll10,141523

University of Tasmania

4. Ham, NC. The planar modular partition monoid.

Degree: 2016, University of Tasmania

URL: https://eprints.utas.edu.au/23029/1/Ham_whole_thesis.pdf

► The primary contribution of this thesis is to introduce and examine the planar modular partition monoid for parameters m, k ∈ Z>0, which has simultaneously…
(more)

Subjects/Keywords: Algebra; Combinatorics; Discrete Mathematics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Ham, N. (2016). The planar modular partition monoid. (Thesis). University of Tasmania. Retrieved from https://eprints.utas.edu.au/23029/1/Ham_whole_thesis.pdf

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Ham, NC. “The planar modular partition monoid.” 2016. Thesis, University of Tasmania. Accessed October 16, 2019. https://eprints.utas.edu.au/23029/1/Ham_whole_thesis.pdf.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Ham, NC. “The planar modular partition monoid.” 2016. Web. 16 Oct 2019.

Vancouver:

Ham N. The planar modular partition monoid. [Internet] [Thesis]. University of Tasmania; 2016. [cited 2019 Oct 16]. Available from: https://eprints.utas.edu.au/23029/1/Ham_whole_thesis.pdf.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Ham N. The planar modular partition monoid. [Thesis]. University of Tasmania; 2016. Available from: https://eprints.utas.edu.au/23029/1/Ham_whole_thesis.pdf

Not specified: Masters Thesis or Doctoral Dissertation

Georgia Southern University

5. Hamlin, Benjamin J. Gallai-Ramsey Number for Classes of Brooms.

Degree: MSin Mathematics (M.S.), Department of Mathematical Sciences, 2019, Georgia Southern University

URL: https://digitalcommons.georgiasouthern.edu/etd/1896

► Given a graph G, we consider the problem of finding the minimum number n such that any k edge colored complete graph on n…
(more)

Subjects/Keywords: Discrete Mathematics and Combinatorics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Hamlin, B. J. (2019). Gallai-Ramsey Number for Classes of Brooms. (Masters Thesis). Georgia Southern University. Retrieved from https://digitalcommons.georgiasouthern.edu/etd/1896

Chicago Manual of Style (16^{th} Edition):

Hamlin, Benjamin J. “Gallai-Ramsey Number for Classes of Brooms.” 2019. Masters Thesis, Georgia Southern University. Accessed October 16, 2019. https://digitalcommons.georgiasouthern.edu/etd/1896.

MLA Handbook (7^{th} Edition):

Hamlin, Benjamin J. “Gallai-Ramsey Number for Classes of Brooms.” 2019. Web. 16 Oct 2019.

Vancouver:

Hamlin BJ. Gallai-Ramsey Number for Classes of Brooms. [Internet] [Masters thesis]. Georgia Southern University; 2019. [cited 2019 Oct 16]. Available from: https://digitalcommons.georgiasouthern.edu/etd/1896.

Council of Science Editors:

Hamlin BJ. Gallai-Ramsey Number for Classes of Brooms. [Masters Thesis]. Georgia Southern University; 2019. Available from: https://digitalcommons.georgiasouthern.edu/etd/1896

Queen Mary, University of London

6.
Falgas-Ravry, Victor.
Thresholds in probabilistic and extremal * combinatorics*.

Degree: PhD, 2012, Queen Mary, University of London

URL: http://qmro.qmul.ac.uk/xmlui/handle/123456789/8827 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.566640

► This thesis lies in the field of probabilistic and extremal *combinatorics*: we study *discrete* structures, with a focus on thresholds, when the behaviour of a…
(more)

Subjects/Keywords: 519.2; Mathematics; Combinatorics; Discrete structures; Probabilistic combinatorics; Extremal combinatorics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Falgas-Ravry, V. (2012). Thresholds in probabilistic and extremal combinatorics. (Doctoral Dissertation). Queen Mary, University of London. Retrieved from http://qmro.qmul.ac.uk/xmlui/handle/123456789/8827 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.566640

Chicago Manual of Style (16^{th} Edition):

Falgas-Ravry, Victor. “Thresholds in probabilistic and extremal combinatorics.” 2012. Doctoral Dissertation, Queen Mary, University of London. Accessed October 16, 2019. http://qmro.qmul.ac.uk/xmlui/handle/123456789/8827 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.566640.

MLA Handbook (7^{th} Edition):

Falgas-Ravry, Victor. “Thresholds in probabilistic and extremal combinatorics.” 2012. Web. 16 Oct 2019.

Vancouver:

Falgas-Ravry V. Thresholds in probabilistic and extremal combinatorics. [Internet] [Doctoral dissertation]. Queen Mary, University of London; 2012. [cited 2019 Oct 16]. Available from: http://qmro.qmul.ac.uk/xmlui/handle/123456789/8827 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.566640.

Council of Science Editors:

Falgas-Ravry V. Thresholds in probabilistic and extremal combinatorics. [Doctoral Dissertation]. Queen Mary, University of London; 2012. Available from: http://qmro.qmul.ac.uk/xmlui/handle/123456789/8827 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.566640

Western Kentucky University

7. Aftene, Florin. Vertex-Relaxed Graceful Labelings of Graphs and Congruences.

Degree: MS, Department of Mathematics, 2018, Western Kentucky University

URL: https://digitalcommons.wku.edu/theses/2664

► A labeling of a graph is an assignment of a natural number to each vertex of a graph. Graceful labelings are very important types…
(more)

Subjects/Keywords: Graph Theory; Discrete Mathematics and Combinatorics; Mathematics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Aftene, F. (2018). Vertex-Relaxed Graceful Labelings of Graphs and Congruences. (Masters Thesis). Western Kentucky University. Retrieved from https://digitalcommons.wku.edu/theses/2664

Chicago Manual of Style (16^{th} Edition):

Aftene, Florin. “Vertex-Relaxed Graceful Labelings of Graphs and Congruences.” 2018. Masters Thesis, Western Kentucky University. Accessed October 16, 2019. https://digitalcommons.wku.edu/theses/2664.

MLA Handbook (7^{th} Edition):

Aftene, Florin. “Vertex-Relaxed Graceful Labelings of Graphs and Congruences.” 2018. Web. 16 Oct 2019.

Vancouver:

Aftene F. Vertex-Relaxed Graceful Labelings of Graphs and Congruences. [Internet] [Masters thesis]. Western Kentucky University; 2018. [cited 2019 Oct 16]. Available from: https://digitalcommons.wku.edu/theses/2664.

Council of Science Editors:

Aftene F. Vertex-Relaxed Graceful Labelings of Graphs and Congruences. [Masters Thesis]. Western Kentucky University; 2018. Available from: https://digitalcommons.wku.edu/theses/2664

Nanyang Technological University

8. Huang, Yiwei. The interplay of designs and difference sets .

Degree: 2011, Nanyang Technological University

URL: http://hdl.handle.net/10356/43666

► It is well known that a (divisible) design with a regular automorphism group (Singer group) is equivalent to a (relative) difference set in that group.…
(more)

Subjects/Keywords: DRNTU::Science::Mathematics::Discrete mathematics::Combinatorics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Huang, Y. (2011). The interplay of designs and difference sets . (Thesis). Nanyang Technological University. Retrieved from http://hdl.handle.net/10356/43666

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Huang, Yiwei. “The interplay of designs and difference sets .” 2011. Thesis, Nanyang Technological University. Accessed October 16, 2019. http://hdl.handle.net/10356/43666.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Huang, Yiwei. “The interplay of designs and difference sets .” 2011. Web. 16 Oct 2019.

Vancouver:

Huang Y. The interplay of designs and difference sets . [Internet] [Thesis]. Nanyang Technological University; 2011. [cited 2019 Oct 16]. Available from: http://hdl.handle.net/10356/43666.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Huang Y. The interplay of designs and difference sets . [Thesis]. Nanyang Technological University; 2011. Available from: http://hdl.handle.net/10356/43666

Not specified: Masters Thesis or Doctoral Dissertation

University of Colorado

9. Andrews, Scott D. Type-free Approaches to Supercharacter Theories of Unipotent Groups.

Degree: PhD, Mathematics, 2014, University of Colorado

URL: http://scholar.colorado.edu/math_gradetds/31

► Supercharacter theories are a relatively new tool in studying the representation theory of unipotent groups over finite fields. In this thesis I present two…
(more)

Subjects/Keywords: combinatorics; representation theory; supercharacter; unipotent group; Discrete Mathematics and Combinatorics; Mathematics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Andrews, S. D. (2014). Type-free Approaches to Supercharacter Theories of Unipotent Groups. (Doctoral Dissertation). University of Colorado. Retrieved from http://scholar.colorado.edu/math_gradetds/31

Chicago Manual of Style (16^{th} Edition):

Andrews, Scott D. “Type-free Approaches to Supercharacter Theories of Unipotent Groups.” 2014. Doctoral Dissertation, University of Colorado. Accessed October 16, 2019. http://scholar.colorado.edu/math_gradetds/31.

MLA Handbook (7^{th} Edition):

Andrews, Scott D. “Type-free Approaches to Supercharacter Theories of Unipotent Groups.” 2014. Web. 16 Oct 2019.

Vancouver:

Andrews SD. Type-free Approaches to Supercharacter Theories of Unipotent Groups. [Internet] [Doctoral dissertation]. University of Colorado; 2014. [cited 2019 Oct 16]. Available from: http://scholar.colorado.edu/math_gradetds/31.

Council of Science Editors:

Andrews SD. Type-free Approaches to Supercharacter Theories of Unipotent Groups. [Doctoral Dissertation]. University of Colorado; 2014. Available from: http://scholar.colorado.edu/math_gradetds/31

Northeastern University

10.
Stella, Salvatore.
* Discrete* structures in finite type cluster algebras.

Degree: PhD, Department of Mathematics, 2013, Northeastern University

URL: http://hdl.handle.net/2047/d20003060

► Due to their recursive definition, manipulating cluster algebras in an efficient way can be hard. Several combinatorial models have been developed in order to overcome…
(more)

Subjects/Keywords: Cluster Algebras; Combinatorics; Algebra; Discrete Mathematics and Combinatorics; Mathematics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Stella, S. (2013). Discrete structures in finite type cluster algebras. (Doctoral Dissertation). Northeastern University. Retrieved from http://hdl.handle.net/2047/d20003060

Chicago Manual of Style (16^{th} Edition):

Stella, Salvatore. “Discrete structures in finite type cluster algebras.” 2013. Doctoral Dissertation, Northeastern University. Accessed October 16, 2019. http://hdl.handle.net/2047/d20003060.

MLA Handbook (7^{th} Edition):

Stella, Salvatore. “Discrete structures in finite type cluster algebras.” 2013. Web. 16 Oct 2019.

Vancouver:

Stella S. Discrete structures in finite type cluster algebras. [Internet] [Doctoral dissertation]. Northeastern University; 2013. [cited 2019 Oct 16]. Available from: http://hdl.handle.net/2047/d20003060.

Council of Science Editors:

Stella S. Discrete structures in finite type cluster algebras. [Doctoral Dissertation]. Northeastern University; 2013. Available from: http://hdl.handle.net/2047/d20003060

University of Pennsylvania

11.
Liang, Tian.
An Overview of the Geometry and *Combinatorics* of the Macdonald Polynomial and q-t Catalan Number.

Degree: 2010, University of Pennsylvania

URL: https://repository.upenn.edu/edissertations/114

► We will explore the combinatorial and geometric properties related to the Macdonald polynomials and the diagonal harmonics. We have the combinatorial Macdonald polynomial formula that…
(more)

Subjects/Keywords: Macdonald polynomial; Discrete Mathematics and Combinatorics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Liang, T. (2010). An Overview of the Geometry and Combinatorics of the Macdonald Polynomial and q-t Catalan Number. (Thesis). University of Pennsylvania. Retrieved from https://repository.upenn.edu/edissertations/114

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Liang, Tian. “An Overview of the Geometry and Combinatorics of the Macdonald Polynomial and q-t Catalan Number.” 2010. Thesis, University of Pennsylvania. Accessed October 16, 2019. https://repository.upenn.edu/edissertations/114.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Liang, Tian. “An Overview of the Geometry and Combinatorics of the Macdonald Polynomial and q-t Catalan Number.” 2010. Web. 16 Oct 2019.

Vancouver:

Liang T. An Overview of the Geometry and Combinatorics of the Macdonald Polynomial and q-t Catalan Number. [Internet] [Thesis]. University of Pennsylvania; 2010. [cited 2019 Oct 16]. Available from: https://repository.upenn.edu/edissertations/114.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Liang T. An Overview of the Geometry and Combinatorics of the Macdonald Polynomial and q-t Catalan Number. [Thesis]. University of Pennsylvania; 2010. Available from: https://repository.upenn.edu/edissertations/114

Not specified: Masters Thesis or Doctoral Dissertation

University of Manitoba

12. Tsaturian, Sergei. Problems in extremal graph theory and Euclidean Ramsey theory.

Degree: Mathematics, 2019, University of Manitoba

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

► This thesis addresses problems of three types. The first type is finding extremal numbers for unions of graphs, each with a colour-critical edge (joint work…
(more)

Subjects/Keywords: Mathematics; Combinatorics; Graph theory; Discrete geometry

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Tsaturian, S. (2019). Problems in extremal graph theory and Euclidean Ramsey theory. (Thesis). University of Manitoba. Retrieved from http://hdl.handle.net/1993/33849

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Tsaturian, Sergei. “Problems in extremal graph theory and Euclidean Ramsey theory.” 2019. Thesis, University of Manitoba. Accessed October 16, 2019. http://hdl.handle.net/1993/33849.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Tsaturian, Sergei. “Problems in extremal graph theory and Euclidean Ramsey theory.” 2019. Web. 16 Oct 2019.

Vancouver:

Tsaturian S. Problems in extremal graph theory and Euclidean Ramsey theory. [Internet] [Thesis]. University of Manitoba; 2019. [cited 2019 Oct 16]. Available from: http://hdl.handle.net/1993/33849.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Tsaturian S. Problems in extremal graph theory and Euclidean Ramsey theory. [Thesis]. University of Manitoba; 2019. Available from: http://hdl.handle.net/1993/33849

Not specified: Masters Thesis or Doctoral Dissertation

University of Kentucky

13. Chandrasekhar, Karthik. BOUNDING THE NUMBER OF COMPATIBLE SIMPLICES IN HIGHER DIMENSIONAL TOURNAMENTS.

Degree: 2019, University of Kentucky

URL: https://uknowledge.uky.edu/math_etds/63

► A tournament graph G is a vertex set V of size n, together with a directed edge set E ⊂ V × V such that…
(more)

Subjects/Keywords: Discrete Mathematics; Number Theory; Discrete Mathematics and Combinatorics; Number Theory

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Chandrasekhar, K. (2019). BOUNDING THE NUMBER OF COMPATIBLE SIMPLICES IN HIGHER DIMENSIONAL TOURNAMENTS. (Doctoral Dissertation). University of Kentucky. Retrieved from https://uknowledge.uky.edu/math_etds/63

Chicago Manual of Style (16^{th} Edition):

Chandrasekhar, Karthik. “BOUNDING THE NUMBER OF COMPATIBLE SIMPLICES IN HIGHER DIMENSIONAL TOURNAMENTS.” 2019. Doctoral Dissertation, University of Kentucky. Accessed October 16, 2019. https://uknowledge.uky.edu/math_etds/63.

MLA Handbook (7^{th} Edition):

Chandrasekhar, Karthik. “BOUNDING THE NUMBER OF COMPATIBLE SIMPLICES IN HIGHER DIMENSIONAL TOURNAMENTS.” 2019. Web. 16 Oct 2019.

Vancouver:

Chandrasekhar K. BOUNDING THE NUMBER OF COMPATIBLE SIMPLICES IN HIGHER DIMENSIONAL TOURNAMENTS. [Internet] [Doctoral dissertation]. University of Kentucky; 2019. [cited 2019 Oct 16]. Available from: https://uknowledge.uky.edu/math_etds/63.

Council of Science Editors:

Chandrasekhar K. BOUNDING THE NUMBER OF COMPATIBLE SIMPLICES IN HIGHER DIMENSIONAL TOURNAMENTS. [Doctoral Dissertation]. University of Kentucky; 2019. Available from: https://uknowledge.uky.edu/math_etds/63

California State University – San Bernardino

14. Hearon, Sean M. PLANAR GRAPHS, BIPLANAR GRAPHS AND GRAPH THICKNESS.

Degree: MAin Mathematics, Mathematics, 2016, California State University – San Bernardino

URL: http://scholarworks.lib.csusb.edu/etd/427

► A graph is planar if it can be drawn on a piece of paper such that no two edges cross. The smallest complete and…
(more)

Subjects/Keywords: Graphs; Combinatorics; Planar; Biplanar; Graph thickness; Discrete Mathematics and Combinatorics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Hearon, S. M. (2016). PLANAR GRAPHS, BIPLANAR GRAPHS AND GRAPH THICKNESS. (Thesis). California State University – San Bernardino. Retrieved from http://scholarworks.lib.csusb.edu/etd/427

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Hearon, Sean M. “PLANAR GRAPHS, BIPLANAR GRAPHS AND GRAPH THICKNESS.” 2016. Thesis, California State University – San Bernardino. Accessed October 16, 2019. http://scholarworks.lib.csusb.edu/etd/427.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Hearon, Sean M. “PLANAR GRAPHS, BIPLANAR GRAPHS AND GRAPH THICKNESS.” 2016. Web. 16 Oct 2019.

Vancouver:

Hearon SM. PLANAR GRAPHS, BIPLANAR GRAPHS AND GRAPH THICKNESS. [Internet] [Thesis]. California State University – San Bernardino; 2016. [cited 2019 Oct 16]. Available from: http://scholarworks.lib.csusb.edu/etd/427.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Hearon SM. PLANAR GRAPHS, BIPLANAR GRAPHS AND GRAPH THICKNESS. [Thesis]. California State University – San Bernardino; 2016. Available from: http://scholarworks.lib.csusb.edu/etd/427

Not specified: Masters Thesis or Doctoral Dissertation

Michigan Technological University

15. Davies, Joshua Thomas Agustin. Distribution of permutation statistics across pattern avoidance classes, and the search for a Denert-associated condition equivalent to pattern avoidance.

Degree: MS, Department of Mathematical Sciences, 2017, Michigan Technological University

URL: http://digitalcommons.mtu.edu/etdr/328

► We begin with a discussion of the symmetricity of \maj over \des in pattern avoidance classes, and its relationship to \maj-Wilf equivalence. From this,…
(more)

Subjects/Keywords: combinatorics; permutations; pattern avoidance; permutation statistics; Discrete Mathematics and Combinatorics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Davies, J. T. A. (2017). Distribution of permutation statistics across pattern avoidance classes, and the search for a Denert-associated condition equivalent to pattern avoidance. (Masters Thesis). Michigan Technological University. Retrieved from http://digitalcommons.mtu.edu/etdr/328

Chicago Manual of Style (16^{th} Edition):

Davies, Joshua Thomas Agustin. “Distribution of permutation statistics across pattern avoidance classes, and the search for a Denert-associated condition equivalent to pattern avoidance.” 2017. Masters Thesis, Michigan Technological University. Accessed October 16, 2019. http://digitalcommons.mtu.edu/etdr/328.

MLA Handbook (7^{th} Edition):

Davies, Joshua Thomas Agustin. “Distribution of permutation statistics across pattern avoidance classes, and the search for a Denert-associated condition equivalent to pattern avoidance.” 2017. Web. 16 Oct 2019.

Vancouver:

Davies JTA. Distribution of permutation statistics across pattern avoidance classes, and the search for a Denert-associated condition equivalent to pattern avoidance. [Internet] [Masters thesis]. Michigan Technological University; 2017. [cited 2019 Oct 16]. Available from: http://digitalcommons.mtu.edu/etdr/328.

Council of Science Editors:

Davies JTA. Distribution of permutation statistics across pattern avoidance classes, and the search for a Denert-associated condition equivalent to pattern avoidance. [Masters Thesis]. Michigan Technological University; 2017. Available from: http://digitalcommons.mtu.edu/etdr/328

East Tennessee State University

16. Justus, Amanda N. Permutation Groups and Puzzle Tile Configurations of Instant Insanity II.

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

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

► The manufacturer claims that there is only one solution to the puzzle Instant Insanity II. However, a recent paper shows that there are two…
(more)

Subjects/Keywords: algebra; group theory; combinatorics; Algebra; Discrete Mathematics and Combinatorics; Set Theory

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Justus, A. N. (2014). Permutation Groups and Puzzle Tile Configurations of Instant Insanity II. (Masters Thesis). East Tennessee State University. Retrieved from https://dc.etsu.edu/etd/2337

Chicago Manual of Style (16^{th} Edition):

Justus, Amanda N. “Permutation Groups and Puzzle Tile Configurations of Instant Insanity II.” 2014. Masters Thesis, East Tennessee State University. Accessed October 16, 2019. https://dc.etsu.edu/etd/2337.

MLA Handbook (7^{th} Edition):

Justus, Amanda N. “Permutation Groups and Puzzle Tile Configurations of Instant Insanity II.” 2014. Web. 16 Oct 2019.

Vancouver:

Justus AN. Permutation Groups and Puzzle Tile Configurations of Instant Insanity II. [Internet] [Masters thesis]. East Tennessee State University; 2014. [cited 2019 Oct 16]. Available from: https://dc.etsu.edu/etd/2337.

Council of Science Editors:

Justus AN. Permutation Groups and Puzzle Tile Configurations of Instant Insanity II. [Masters Thesis]. East Tennessee State University; 2014. Available from: https://dc.etsu.edu/etd/2337

Western Kentucky University

17. Riggle, Matthew. Runs of Identical Outcomes in a Sequence of Bernoulli Trials.

Degree: MS, Department of Mathematics, 2018, Western Kentucky University

URL: https://digitalcommons.wku.edu/theses/2451

► The Bernoulli distribution is a basic, well-studied distribution in probability. In this thesis, we will consider repeated Bernoulli trials in order to study runs…
(more)

Subjects/Keywords: probability; mathematics; statistics; expectation; Applied Mathematics; Discrete Mathematics and Combinatorics; Mathematics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Riggle, M. (2018). Runs of Identical Outcomes in a Sequence of Bernoulli Trials. (Masters Thesis). Western Kentucky University. Retrieved from https://digitalcommons.wku.edu/theses/2451

Chicago Manual of Style (16^{th} Edition):

Riggle, Matthew. “Runs of Identical Outcomes in a Sequence of Bernoulli Trials.” 2018. Masters Thesis, Western Kentucky University. Accessed October 16, 2019. https://digitalcommons.wku.edu/theses/2451.

MLA Handbook (7^{th} Edition):

Riggle, Matthew. “Runs of Identical Outcomes in a Sequence of Bernoulli Trials.” 2018. Web. 16 Oct 2019.

Vancouver:

Riggle M. Runs of Identical Outcomes in a Sequence of Bernoulli Trials. [Internet] [Masters thesis]. Western Kentucky University; 2018. [cited 2019 Oct 16]. Available from: https://digitalcommons.wku.edu/theses/2451.

Council of Science Editors:

Riggle M. Runs of Identical Outcomes in a Sequence of Bernoulli Trials. [Masters Thesis]. Western Kentucky University; 2018. Available from: https://digitalcommons.wku.edu/theses/2451

University of Kentucky

18. Taylor, Clifford T. Deletion-Induced Triangulations.

Degree: 2015, University of Kentucky

URL: https://uknowledge.uky.edu/math_etds/24

► Let d > 0 be a fixed integer and let A ⊆ ℝd be a collection of n ≥ d + 2 points which we…
(more)

Subjects/Keywords: Discrete Geometry; Polytopes; Secondary polytopes; Lawrence Polytopes; Discrete Mathematics and Combinatorics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Taylor, C. T. (2015). Deletion-Induced Triangulations. (Doctoral Dissertation). University of Kentucky. Retrieved from https://uknowledge.uky.edu/math_etds/24

Chicago Manual of Style (16^{th} Edition):

Taylor, Clifford T. “Deletion-Induced Triangulations.” 2015. Doctoral Dissertation, University of Kentucky. Accessed October 16, 2019. https://uknowledge.uky.edu/math_etds/24.

MLA Handbook (7^{th} Edition):

Taylor, Clifford T. “Deletion-Induced Triangulations.” 2015. Web. 16 Oct 2019.

Vancouver:

Taylor CT. Deletion-Induced Triangulations. [Internet] [Doctoral dissertation]. University of Kentucky; 2015. [cited 2019 Oct 16]. Available from: https://uknowledge.uky.edu/math_etds/24.

Council of Science Editors:

Taylor CT. Deletion-Induced Triangulations. [Doctoral Dissertation]. University of Kentucky; 2015. Available from: https://uknowledge.uky.edu/math_etds/24

California State University – San Bernardino

19. James, Lacey Taylor. Analogues Between Leibniz's Harmonic Triangle and Pascal's Arithmetic Triangle.

Degree: MAin Mathematics, Mathematics, 2019, California State University – San Bernardino

URL: https://scholarworks.lib.csusb.edu/etd/835

► This paper will discuss the analogues between Leibniz's Harmonic Triangle and Pascal's Arithmetic Triangle by utilizing mathematical proving techniques like partial sums, committees, telescoping,…
(more)

Subjects/Keywords: triangular arrays; Algebra; Discrete Mathematics and Combinatorics; Other Mathematics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

James, L. T. (2019). Analogues Between Leibniz's Harmonic Triangle and Pascal's Arithmetic Triangle. (Thesis). California State University – San Bernardino. Retrieved from https://scholarworks.lib.csusb.edu/etd/835

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

James, Lacey Taylor. “Analogues Between Leibniz's Harmonic Triangle and Pascal's Arithmetic Triangle.” 2019. Thesis, California State University – San Bernardino. Accessed October 16, 2019. https://scholarworks.lib.csusb.edu/etd/835.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

James, Lacey Taylor. “Analogues Between Leibniz's Harmonic Triangle and Pascal's Arithmetic Triangle.” 2019. Web. 16 Oct 2019.

Vancouver:

James LT. Analogues Between Leibniz's Harmonic Triangle and Pascal's Arithmetic Triangle. [Internet] [Thesis]. California State University – San Bernardino; 2019. [cited 2019 Oct 16]. Available from: https://scholarworks.lib.csusb.edu/etd/835.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

James LT. Analogues Between Leibniz's Harmonic Triangle and Pascal's Arithmetic Triangle. [Thesis]. California State University – San Bernardino; 2019. Available from: https://scholarworks.lib.csusb.edu/etd/835

Not specified: Masters Thesis or Doctoral Dissertation

University of Tennessee – Knoxville

20. Ashe, James Russell. Generalized Branching in Circle Packing.

Degree: 2012, University of Tennessee – Knoxville

URL: https://trace.tennessee.edu/utk_graddiss/1263

► Circle packings are configurations of circle with prescribed patterns of tangency. They relate to a surprisingly diverse array of topics. Connections to Riemann surfaces, Apollonian…
(more)

Subjects/Keywords: circle packing; branching; geometry; discrete; conformal; Analysis; Discrete Mathematics and Combinatorics; Geometry and Topology; Mathematics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Ashe, J. R. (2012). Generalized Branching in Circle Packing. (Doctoral Dissertation). University of Tennessee – Knoxville. Retrieved from https://trace.tennessee.edu/utk_graddiss/1263

Chicago Manual of Style (16^{th} Edition):

Ashe, James Russell. “Generalized Branching in Circle Packing.” 2012. Doctoral Dissertation, University of Tennessee – Knoxville. Accessed October 16, 2019. https://trace.tennessee.edu/utk_graddiss/1263.

MLA Handbook (7^{th} Edition):

Ashe, James Russell. “Generalized Branching in Circle Packing.” 2012. Web. 16 Oct 2019.

Vancouver:

Ashe JR. Generalized Branching in Circle Packing. [Internet] [Doctoral dissertation]. University of Tennessee – Knoxville; 2012. [cited 2019 Oct 16]. Available from: https://trace.tennessee.edu/utk_graddiss/1263.

Council of Science Editors:

Ashe JR. Generalized Branching in Circle Packing. [Doctoral Dissertation]. University of Tennessee – Knoxville; 2012. Available from: https://trace.tennessee.edu/utk_graddiss/1263

Kennesaw State University

21. Yang, Yutong. From Simplest Recursion to the Recursion of Generalizations of Cross Polytope Numbers.

Degree: 2017, Kennesaw State University

URL: https://digitalcommons.kennesaw.edu/honors_etd/13

► My research project involves investigations in the mathematical field of *combinatorics*. The research study will be based on the results of Professors Steven Edwards…
(more)

Subjects/Keywords: combinatorics; recursion; crosspolytope; number; integer; pascal; Discrete Mathematics and Combinatorics; Number Theory

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Yang, Y. (2017). From Simplest Recursion to the Recursion of Generalizations of Cross Polytope Numbers. (Thesis). Kennesaw State University. Retrieved from https://digitalcommons.kennesaw.edu/honors_etd/13

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Yang, Yutong. “From Simplest Recursion to the Recursion of Generalizations of Cross Polytope Numbers.” 2017. Thesis, Kennesaw State University. Accessed October 16, 2019. https://digitalcommons.kennesaw.edu/honors_etd/13.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Yang, Yutong. “From Simplest Recursion to the Recursion of Generalizations of Cross Polytope Numbers.” 2017. Web. 16 Oct 2019.

Vancouver:

Yang Y. From Simplest Recursion to the Recursion of Generalizations of Cross Polytope Numbers. [Internet] [Thesis]. Kennesaw State University; 2017. [cited 2019 Oct 16]. Available from: https://digitalcommons.kennesaw.edu/honors_etd/13.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Yang Y. From Simplest Recursion to the Recursion of Generalizations of Cross Polytope Numbers. [Thesis]. Kennesaw State University; 2017. Available from: https://digitalcommons.kennesaw.edu/honors_etd/13

Not specified: Masters Thesis or Doctoral Dissertation

Michigan Technological University

22. Judge, Samuel. On the Density of the Odd Values of the Partition Function.

Degree: PhD, Department of Mathematical Sciences, 2018, Michigan Technological University

URL: http://digitalcommons.mtu.edu/etdr/590

► The purpose of this dissertation is to introduce a new approach to the study of one of the most basic and seemingly intractable problems…
(more)

Subjects/Keywords: Partitions; Congruences; Modular Forms; Combinatorics; Parity; Algebra; Analysis; Discrete Mathematics and Combinatorics; Number Theory

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Judge, S. (2018). On the Density of the Odd Values of the Partition Function. (Doctoral Dissertation). Michigan Technological University. Retrieved from http://digitalcommons.mtu.edu/etdr/590

Chicago Manual of Style (16^{th} Edition):

Judge, Samuel. “On the Density of the Odd Values of the Partition Function.” 2018. Doctoral Dissertation, Michigan Technological University. Accessed October 16, 2019. http://digitalcommons.mtu.edu/etdr/590.

MLA Handbook (7^{th} Edition):

Judge, Samuel. “On the Density of the Odd Values of the Partition Function.” 2018. Web. 16 Oct 2019.

Vancouver:

Judge S. On the Density of the Odd Values of the Partition Function. [Internet] [Doctoral dissertation]. Michigan Technological University; 2018. [cited 2019 Oct 16]. Available from: http://digitalcommons.mtu.edu/etdr/590.

Council of Science Editors:

Judge S. On the Density of the Odd Values of the Partition Function. [Doctoral Dissertation]. Michigan Technological University; 2018. Available from: http://digitalcommons.mtu.edu/etdr/590

University of Kentucky

23. Blyman, Kayla. Influences of Probability Instruction on Undergraduates' Understanding of Counting Processes.

Degree: 2017, University of Kentucky

URL: https://uknowledge.uky.edu/edsc_etds/24

► Historically, students in an introductory finite *mathematics* course at a major university in the mid-south have struggled the most with the counting and probability unit,…
(more)

Subjects/Keywords: Undergraduate Mathematics Education; Combinatorics Education; Counting; Probability; Finite Mathematics; Discrete Mathematics and Combinatorics; Higher Education; Probability; Science and Mathematics Education

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Blyman, K. (2017). Influences of Probability Instruction on Undergraduates' Understanding of Counting Processes. (Doctoral Dissertation). University of Kentucky. Retrieved from https://uknowledge.uky.edu/edsc_etds/24

Chicago Manual of Style (16^{th} Edition):

Blyman, Kayla. “Influences of Probability Instruction on Undergraduates' Understanding of Counting Processes.” 2017. Doctoral Dissertation, University of Kentucky. Accessed October 16, 2019. https://uknowledge.uky.edu/edsc_etds/24.

MLA Handbook (7^{th} Edition):

Blyman, Kayla. “Influences of Probability Instruction on Undergraduates' Understanding of Counting Processes.” 2017. Web. 16 Oct 2019.

Vancouver:

Blyman K. Influences of Probability Instruction on Undergraduates' Understanding of Counting Processes. [Internet] [Doctoral dissertation]. University of Kentucky; 2017. [cited 2019 Oct 16]. Available from: https://uknowledge.uky.edu/edsc_etds/24.

Council of Science Editors:

Blyman K. Influences of Probability Instruction on Undergraduates' Understanding of Counting Processes. [Doctoral Dissertation]. University of Kentucky; 2017. Available from: https://uknowledge.uky.edu/edsc_etds/24

East Tennessee State University

24. Harris, Elizabeth Marie. Global Domination Stable Graphs.

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

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

► A set of vertices <i>S</i> in a graph <i>G</i> is a global dominating set (GDS) of <i>G</i> if <i>S</i> is a dominating set for…
(more)

Subjects/Keywords: Global Domination; Graph Theory; Stable; Mathematics; Discrete Mathematics and Combinatorics; Mathematics; Physical Sciences and Mathematics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Harris, E. M. (2012). Global Domination Stable Graphs. (Masters Thesis). East Tennessee State University. Retrieved from https://dc.etsu.edu/etd/1476

Chicago Manual of Style (16^{th} Edition):

Harris, Elizabeth Marie. “Global Domination Stable Graphs.” 2012. Masters Thesis, East Tennessee State University. Accessed October 16, 2019. https://dc.etsu.edu/etd/1476.

MLA Handbook (7^{th} Edition):

Harris, Elizabeth Marie. “Global Domination Stable Graphs.” 2012. Web. 16 Oct 2019.

Vancouver:

Harris EM. Global Domination Stable Graphs. [Internet] [Masters thesis]. East Tennessee State University; 2012. [cited 2019 Oct 16]. Available from: https://dc.etsu.edu/etd/1476.

Council of Science Editors:

Harris EM. Global Domination Stable Graphs. [Masters Thesis]. East Tennessee State University; 2012. Available from: https://dc.etsu.edu/etd/1476

California State University – San Bernardino

25. Alshaikh, Rana Ali. Upset Paths and 2-Majority Tournaments.

Degree: MAin Mathematics, Mathematics, 2016, California State University – San Bernardino

URL: http://scholarworks.lib.csusb.edu/etd/356

► In 2005, Alon, et al. proved that tournaments arising from majority voting scenarios have minimum dominating sets that are bounded by a constant that…
(more)

Subjects/Keywords: upset paths; 2-majority tournaments; UP-sets.; Discrete Mathematics and Combinatorics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Alshaikh, R. A. (2016). Upset Paths and 2-Majority Tournaments. (Thesis). California State University – San Bernardino. Retrieved from http://scholarworks.lib.csusb.edu/etd/356

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Alshaikh, Rana Ali. “Upset Paths and 2-Majority Tournaments.” 2016. Thesis, California State University – San Bernardino. Accessed October 16, 2019. http://scholarworks.lib.csusb.edu/etd/356.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Alshaikh, Rana Ali. “Upset Paths and 2-Majority Tournaments.” 2016. Web. 16 Oct 2019.

Vancouver:

Alshaikh RA. Upset Paths and 2-Majority Tournaments. [Internet] [Thesis]. California State University – San Bernardino; 2016. [cited 2019 Oct 16]. Available from: http://scholarworks.lib.csusb.edu/etd/356.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Alshaikh RA. Upset Paths and 2-Majority Tournaments. [Thesis]. California State University – San Bernardino; 2016. Available from: http://scholarworks.lib.csusb.edu/etd/356

Not specified: Masters Thesis or Doctoral Dissertation

East Tennessee State University

26. Gardner, Bradley. Italian Domination on Ladders and Related Products.

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

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

► An Italian dominating function on a graph G = (V,E) is a function such that f : V → {0,1,2}, and for each vertex…
(more)

Subjects/Keywords: graph theory; graph products; Italian domination; Discrete Mathematics and Combinatorics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Gardner, B. (2018). Italian Domination on Ladders and Related Products. (Masters Thesis). East Tennessee State University. Retrieved from https://dc.etsu.edu/etd/3509

Chicago Manual of Style (16^{th} Edition):

Gardner, Bradley. “Italian Domination on Ladders and Related Products.” 2018. Masters Thesis, East Tennessee State University. Accessed October 16, 2019. https://dc.etsu.edu/etd/3509.

MLA Handbook (7^{th} Edition):

Gardner, Bradley. “Italian Domination on Ladders and Related Products.” 2018. Web. 16 Oct 2019.

Vancouver:

Gardner B. Italian Domination on Ladders and Related Products. [Internet] [Masters thesis]. East Tennessee State University; 2018. [cited 2019 Oct 16]. Available from: https://dc.etsu.edu/etd/3509.

Council of Science Editors:

Gardner B. Italian Domination on Ladders and Related Products. [Masters Thesis]. East Tennessee State University; 2018. Available from: https://dc.etsu.edu/etd/3509

East Tennessee State University

27. Murphy, Kyle. On t-Restricted Optimal Rubbling of Graphs.

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

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

► For a graph G = (V;E), a pebble distribution is defined as a mapping of the vertex set in to the integers, where each…
(more)

Subjects/Keywords: graph theory; pebbling; rubbling; Discrete Mathematics and Combinatorics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Murphy, K. (2017). On t-Restricted Optimal Rubbling of Graphs. (Masters Thesis). East Tennessee State University. Retrieved from https://dc.etsu.edu/etd/3251

Chicago Manual of Style (16^{th} Edition):

Murphy, Kyle. “On t-Restricted Optimal Rubbling of Graphs.” 2017. Masters Thesis, East Tennessee State University. Accessed October 16, 2019. https://dc.etsu.edu/etd/3251.

MLA Handbook (7^{th} Edition):

Murphy, Kyle. “On t-Restricted Optimal Rubbling of Graphs.” 2017. Web. 16 Oct 2019.

Vancouver:

Murphy K. On t-Restricted Optimal Rubbling of Graphs. [Internet] [Masters thesis]. East Tennessee State University; 2017. [cited 2019 Oct 16]. Available from: https://dc.etsu.edu/etd/3251.

Council of Science Editors:

Murphy K. On t-Restricted Optimal Rubbling of Graphs. [Masters Thesis]. East Tennessee State University; 2017. Available from: https://dc.etsu.edu/etd/3251

28. Hogan, Christopher J. Community Detection Detailed for Online Social Networks.

Degree: 2015, Wilfrid Laurier University

URL: https://scholars.wlu.ca/etd/1737

► Ever since the internet became publicly available it has allowed users to interact with each other across virtual networks. With this large amounts of data…
(more)

Subjects/Keywords: Discrete Mathematics and Combinatorics

…network analysis [26].
8
1.2.2
Linear Algebra
Often in *mathematics* data is…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Hogan, C. J. (2015). Community Detection Detailed for Online Social Networks. (Thesis). Wilfrid Laurier University. Retrieved from https://scholars.wlu.ca/etd/1737

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Hogan, Christopher J. “Community Detection Detailed for Online Social Networks.” 2015. Thesis, Wilfrid Laurier University. Accessed October 16, 2019. https://scholars.wlu.ca/etd/1737.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Hogan, Christopher J. “Community Detection Detailed for Online Social Networks.” 2015. Web. 16 Oct 2019.

Vancouver:

Hogan CJ. Community Detection Detailed for Online Social Networks. [Internet] [Thesis]. Wilfrid Laurier University; 2015. [cited 2019 Oct 16]. Available from: https://scholars.wlu.ca/etd/1737.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Hogan CJ. Community Detection Detailed for Online Social Networks. [Thesis]. Wilfrid Laurier University; 2015. Available from: https://scholars.wlu.ca/etd/1737

Not specified: Masters Thesis or Doctoral Dissertation

Virginia Commonwealth University

29. Crenshaw, Cameron M. Edge-Transitive Bipartite Direct Products.

Degree: MS, Mathematical Sciences, 2017, Virginia Commonwealth University

URL: https://scholarscompass.vcu.edu/etd/4801

► In their recent paper ``Edge-transitive products," Hammack, Imrich, and Klavzar showed that the direct product of connected, non-bipartite graphs is edge-transitive if and only…
(more)

Subjects/Keywords: graph bipartite edge-transitive direct product; Discrete Mathematics and Combinatorics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Crenshaw, C. M. (2017). Edge-Transitive Bipartite Direct Products. (Thesis). Virginia Commonwealth University. Retrieved from https://scholarscompass.vcu.edu/etd/4801

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Crenshaw, Cameron M. “Edge-Transitive Bipartite Direct Products.” 2017. Thesis, Virginia Commonwealth University. Accessed October 16, 2019. https://scholarscompass.vcu.edu/etd/4801.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Crenshaw, Cameron M. “Edge-Transitive Bipartite Direct Products.” 2017. Web. 16 Oct 2019.

Vancouver:

Crenshaw CM. Edge-Transitive Bipartite Direct Products. [Internet] [Thesis]. Virginia Commonwealth University; 2017. [cited 2019 Oct 16]. Available from: https://scholarscompass.vcu.edu/etd/4801.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Crenshaw CM. Edge-Transitive Bipartite Direct Products. [Thesis]. Virginia Commonwealth University; 2017. Available from: https://scholarscompass.vcu.edu/etd/4801

Not specified: Masters Thesis or Doctoral Dissertation

30. Roberti, R. Exact Algorithms for Different Classes of Vehicle Routing Problems.

Degree: 2012, NARCIS

URL: https://research.vu.nl/en/publications/2dbf444e-d7ec-449c-8f2e-83a732290f5b ; urn:nbn:nl:ui:31-2dbf444e-d7ec-449c-8f2e-83a732290f5b ; 2dbf444e-d7ec-449c-8f2e-83a732290f5b ; 1871.1/2dbf444e-d7ec-449c-8f2e-83a732290f5b ; urn:nbn:nl:ui:31-2dbf444e-d7ec-449c-8f2e-83a732290f5b ; https://research.vu.nl/en/publications/2dbf444e-d7ec-449c-8f2e-83a732290f5b

Subjects/Keywords: Discrete Mathematics and Combinatorics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Roberti, R. (2012). Exact Algorithms for Different Classes of Vehicle Routing Problems. (Doctoral Dissertation). NARCIS. Retrieved from https://research.vu.nl/en/publications/2dbf444e-d7ec-449c-8f2e-83a732290f5b ; urn:nbn:nl:ui:31-2dbf444e-d7ec-449c-8f2e-83a732290f5b ; 2dbf444e-d7ec-449c-8f2e-83a732290f5b ; 1871.1/2dbf444e-d7ec-449c-8f2e-83a732290f5b ; urn:nbn:nl:ui:31-2dbf444e-d7ec-449c-8f2e-83a732290f5b ; https://research.vu.nl/en/publications/2dbf444e-d7ec-449c-8f2e-83a732290f5b

Chicago Manual of Style (16^{th} Edition):

Roberti, R. “Exact Algorithms for Different Classes of Vehicle Routing Problems.” 2012. Doctoral Dissertation, NARCIS. Accessed October 16, 2019. https://research.vu.nl/en/publications/2dbf444e-d7ec-449c-8f2e-83a732290f5b ; urn:nbn:nl:ui:31-2dbf444e-d7ec-449c-8f2e-83a732290f5b ; 2dbf444e-d7ec-449c-8f2e-83a732290f5b ; 1871.1/2dbf444e-d7ec-449c-8f2e-83a732290f5b ; urn:nbn:nl:ui:31-2dbf444e-d7ec-449c-8f2e-83a732290f5b ; https://research.vu.nl/en/publications/2dbf444e-d7ec-449c-8f2e-83a732290f5b.

MLA Handbook (7^{th} Edition):

Roberti, R. “Exact Algorithms for Different Classes of Vehicle Routing Problems.” 2012. Web. 16 Oct 2019.

Vancouver:

Roberti R. Exact Algorithms for Different Classes of Vehicle Routing Problems. [Internet] [Doctoral dissertation]. NARCIS; 2012. [cited 2019 Oct 16]. Available from: https://research.vu.nl/en/publications/2dbf444e-d7ec-449c-8f2e-83a732290f5b ; urn:nbn:nl:ui:31-2dbf444e-d7ec-449c-8f2e-83a732290f5b ; 2dbf444e-d7ec-449c-8f2e-83a732290f5b ; 1871.1/2dbf444e-d7ec-449c-8f2e-83a732290f5b ; urn:nbn:nl:ui:31-2dbf444e-d7ec-449c-8f2e-83a732290f5b ; https://research.vu.nl/en/publications/2dbf444e-d7ec-449c-8f2e-83a732290f5b.

Council of Science Editors:

Roberti R. Exact Algorithms for Different Classes of Vehicle Routing Problems. [Doctoral Dissertation]. NARCIS; 2012. Available from: https://research.vu.nl/en/publications/2dbf444e-d7ec-449c-8f2e-83a732290f5b ; urn:nbn:nl:ui:31-2dbf444e-d7ec-449c-8f2e-83a732290f5b ; 2dbf444e-d7ec-449c-8f2e-83a732290f5b ; 1871.1/2dbf444e-d7ec-449c-8f2e-83a732290f5b ; urn:nbn:nl:ui:31-2dbf444e-d7ec-449c-8f2e-83a732290f5b ; https://research.vu.nl/en/publications/2dbf444e-d7ec-449c-8f2e-83a732290f5b