Advanced search options

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

You searched for `subject:(Cayley graph)`

.
Showing records 1 – 30 of
30 total matches.

▼ Search Limiters

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

Degree: 2018, University of Lethbridge

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

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

Subjects/Keywords: Cayley graph

Record Details Similar Records

❌

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

APA (6^{th} Edition):

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

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

Not specified: Masters Thesis or Doctoral Dissertation

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

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

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

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

Vancouver:

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

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

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

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

Not specified: Masters Thesis or Doctoral Dissertation

Mississippi State University

2. Cancela, Elias Damian. Circulant digraph isomorphisms.

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

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

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

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

Record Details Similar Records

❌

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

APA (6^{th} Edition):

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

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

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

MLA Handbook (7^{th} Edition):

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

Vancouver:

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

Council of Science Editors:

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

San Jose State University

3.
Watson, Usha Ganesh.
Integral *Cayley* Graphs Over a Direct Sum of Cyclic Groups of Order 2 and 2p.

Degree: MS, Mathematics, 2011, San Jose State University

URL: https://doi.org/10.31979/etd.vgac-a6gn ; https://scholarworks.sjsu.edu/etd_theses/4080

► *Cayley* graphs for a finite abelian group G are defined over subsets of G called symbols, which are closed under inversion and do not…
(more)

Subjects/Keywords: cayley graph; cyclic; integral

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Watson, U. G. (2011). Integral Cayley Graphs Over a Direct Sum of Cyclic Groups of Order 2 and 2p. (Masters Thesis). San Jose State University. Retrieved from https://doi.org/10.31979/etd.vgac-a6gn ; https://scholarworks.sjsu.edu/etd_theses/4080

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

Watson, Usha Ganesh. “Integral Cayley Graphs Over a Direct Sum of Cyclic Groups of Order 2 and 2p.” 2011. Masters Thesis, San Jose State University. Accessed March 09, 2021. https://doi.org/10.31979/etd.vgac-a6gn ; https://scholarworks.sjsu.edu/etd_theses/4080.

MLA Handbook (7^{th} Edition):

Watson, Usha Ganesh. “Integral Cayley Graphs Over a Direct Sum of Cyclic Groups of Order 2 and 2p.” 2011. Web. 09 Mar 2021.

Vancouver:

Watson UG. Integral Cayley Graphs Over a Direct Sum of Cyclic Groups of Order 2 and 2p. [Internet] [Masters thesis]. San Jose State University; 2011. [cited 2021 Mar 09]. Available from: https://doi.org/10.31979/etd.vgac-a6gn ; https://scholarworks.sjsu.edu/etd_theses/4080.

Council of Science Editors:

Watson UG. Integral Cayley Graphs Over a Direct Sum of Cyclic Groups of Order 2 and 2p. [Masters Thesis]. San Jose State University; 2011. Available from: https://doi.org/10.31979/etd.vgac-a6gn ; https://scholarworks.sjsu.edu/etd_theses/4080

University of Lethbridge

4.
University of Lethbridge. Faculty of Arts and Science.
* Cayley* graphs of order 6pq are Hamiltonian
.

Degree: 2020, University of Lethbridge

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

Assume G is a finite group, such that |G| is either 6pq or 7pq, where p and q are distinct prime numbers, and let S be a generating set of G. We prove there is a Hamiltonian cycle in the corresponding Cayley graph on G with connecting set S.

Subjects/Keywords: Cayley graph; Hamiltonian cycle; Cayley graphs; Hamiltonian graph theory; Graph theory; Dissertations, Academic

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Science, U. o. L. F. o. A. a. (2020). Cayley graphs of order 6pq are Hamiltonian . (Thesis). University of Lethbridge. Retrieved from http://hdl.handle.net/10133/5771

Not specified: Masters Thesis or Doctoral Dissertation

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

Science, University of Lethbridge. Faculty of Arts and. “Cayley graphs of order 6pq are Hamiltonian .” 2020. Thesis, University of Lethbridge. Accessed March 09, 2021. http://hdl.handle.net/10133/5771.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Science, University of Lethbridge. Faculty of Arts and. “Cayley graphs of order 6pq are Hamiltonian .” 2020. Web. 09 Mar 2021.

Vancouver:

Science UoLFoAa. Cayley graphs of order 6pq are Hamiltonian . [Internet] [Thesis]. University of Lethbridge; 2020. [cited 2021 Mar 09]. Available from: http://hdl.handle.net/10133/5771.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Science UoLFoAa. Cayley graphs of order 6pq are Hamiltonian . [Thesis]. University of Lethbridge; 2020. Available from: http://hdl.handle.net/10133/5771

Not specified: Masters Thesis or Doctoral Dissertation

University of Georgia

5.
Rath, Bijaya.
Generation of non-isomorphic cubic *Cayley* graphs.

Degree: 2014, University of Georgia

URL: http://hdl.handle.net/10724/26988

► This thesis investigates the generation of non-isomorphic simple cubic *Cayley* graphs. The research is motivated indirectly by the long standing conjecture that all *Cayley* graphs…
(more)

Subjects/Keywords: Cayley graphs; Hamiltonian graphs; graph isomorphism

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Rath, B. (2014). Generation of non-isomorphic cubic Cayley graphs. (Thesis). University of Georgia. Retrieved from http://hdl.handle.net/10724/26988

Not specified: Masters Thesis or Doctoral Dissertation

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

Rath, Bijaya. “Generation of non-isomorphic cubic Cayley graphs.” 2014. Thesis, University of Georgia. Accessed March 09, 2021. http://hdl.handle.net/10724/26988.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Rath, Bijaya. “Generation of non-isomorphic cubic Cayley graphs.” 2014. Web. 09 Mar 2021.

Vancouver:

Rath B. Generation of non-isomorphic cubic Cayley graphs. [Internet] [Thesis]. University of Georgia; 2014. [cited 2021 Mar 09]. Available from: http://hdl.handle.net/10724/26988.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Rath B. Generation of non-isomorphic cubic Cayley graphs. [Thesis]. University of Georgia; 2014. Available from: http://hdl.handle.net/10724/26988

Not specified: Masters Thesis or Doctoral Dissertation

University of Johannesburg

6. Raubenheimer, Fredrika Susanna. Acyclic colourings of planar graphs.

Degree: 2012, University of Johannesburg

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

►

M.Sc.

Within the field of *Graph* Theory the many ways in which graphs can be coloured have received a lot of attention over the years.…
(more)

Subjects/Keywords: Graph coloring; Four-color problem; Cayley graphs

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Raubenheimer, F. S. (2012). Acyclic colourings of planar graphs. (Thesis). University of Johannesburg. Retrieved from http://hdl.handle.net/10210/6259

Not specified: Masters Thesis or Doctoral Dissertation

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

Raubenheimer, Fredrika Susanna. “Acyclic colourings of planar graphs.” 2012. Thesis, University of Johannesburg. Accessed March 09, 2021. http://hdl.handle.net/10210/6259.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Raubenheimer, Fredrika Susanna. “Acyclic colourings of planar graphs.” 2012. Web. 09 Mar 2021.

Vancouver:

Raubenheimer FS. Acyclic colourings of planar graphs. [Internet] [Thesis]. University of Johannesburg; 2012. [cited 2021 Mar 09]. Available from: http://hdl.handle.net/10210/6259.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Raubenheimer FS. Acyclic colourings of planar graphs. [Thesis]. University of Johannesburg; 2012. Available from: http://hdl.handle.net/10210/6259

Not specified: Masters Thesis or Doctoral Dissertation

University of Oklahoma

7. Wright, Rachel. Totally Reflected Groups.

Degree: PhD, 2016, University of Oklahoma

URL: http://hdl.handle.net/11244/34633

► A group G is totally reflected if it has a generating set S such that each edge in the *Cayley* *graph* Gamma(G,S) is inverted by…
(more)

Subjects/Keywords: Mathematics.; graph reflections; right-angled product; Cayley graph; geometric group theory

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Wright, R. (2016). Totally Reflected Groups. (Doctoral Dissertation). University of Oklahoma. Retrieved from http://hdl.handle.net/11244/34633

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

Wright, Rachel. “Totally Reflected Groups.” 2016. Doctoral Dissertation, University of Oklahoma. Accessed March 09, 2021. http://hdl.handle.net/11244/34633.

MLA Handbook (7^{th} Edition):

Wright, Rachel. “Totally Reflected Groups.” 2016. Web. 09 Mar 2021.

Vancouver:

Wright R. Totally Reflected Groups. [Internet] [Doctoral dissertation]. University of Oklahoma; 2016. [cited 2021 Mar 09]. Available from: http://hdl.handle.net/11244/34633.

Council of Science Editors:

Wright R. Totally Reflected Groups. [Doctoral Dissertation]. University of Oklahoma; 2016. Available from: http://hdl.handle.net/11244/34633

UCLA

8.
Yang, Yilong.
Shapes of Finite Groups through Covering Properties and *Cayley* Graphs.

Degree: Mathematics, 2017, UCLA

URL: http://www.escholarship.org/uc/item/09b4347b

► This thesis is concerned with some asymptotic and geometric properties of finite groups. We shall present two major works with some applications.We present the first…
(more)

Subjects/Keywords: Mathematics; Cayley Graph; Finite Group; Random Walk; Representation; Simple Group; Ultraproduct

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Yang, Y. (2017). Shapes of Finite Groups through Covering Properties and Cayley Graphs. (Thesis). UCLA. Retrieved from http://www.escholarship.org/uc/item/09b4347b

Not specified: Masters Thesis or Doctoral Dissertation

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

Yang, Yilong. “Shapes of Finite Groups through Covering Properties and Cayley Graphs.” 2017. Thesis, UCLA. Accessed March 09, 2021. http://www.escholarship.org/uc/item/09b4347b.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Yang, Yilong. “Shapes of Finite Groups through Covering Properties and Cayley Graphs.” 2017. Web. 09 Mar 2021.

Vancouver:

Yang Y. Shapes of Finite Groups through Covering Properties and Cayley Graphs. [Internet] [Thesis]. UCLA; 2017. [cited 2021 Mar 09]. Available from: http://www.escholarship.org/uc/item/09b4347b.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Yang Y. Shapes of Finite Groups through Covering Properties and Cayley Graphs. [Thesis]. UCLA; 2017. Available from: http://www.escholarship.org/uc/item/09b4347b

Not specified: Masters Thesis or Doctoral Dissertation

University of Windsor

9.
Paulick, Nikita Anne.
Amenability Of *Cayley* graphs Through Use Of Folner's Conditions.

Degree: MS, Mathematics and Statistics, 2020, University of Windsor

URL: https://scholar.uwindsor.ca/etd/8307

► In this thesis we will study the definitions and properties relating to groups and *Cayley* graphs, as well as the concept of amenability. We will…
(more)

Subjects/Keywords: Amenable; Border; Cayley graph; Expansion; Folner sequence; Invariant means

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Paulick, N. A. (2020). Amenability Of Cayley graphs Through Use Of Folner's Conditions. (Masters Thesis). University of Windsor. Retrieved from https://scholar.uwindsor.ca/etd/8307

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

Paulick, Nikita Anne. “Amenability Of Cayley graphs Through Use Of Folner's Conditions.” 2020. Masters Thesis, University of Windsor. Accessed March 09, 2021. https://scholar.uwindsor.ca/etd/8307.

MLA Handbook (7^{th} Edition):

Paulick, Nikita Anne. “Amenability Of Cayley graphs Through Use Of Folner's Conditions.” 2020. Web. 09 Mar 2021.

Vancouver:

Paulick NA. Amenability Of Cayley graphs Through Use Of Folner's Conditions. [Internet] [Masters thesis]. University of Windsor; 2020. [cited 2021 Mar 09]. Available from: https://scholar.uwindsor.ca/etd/8307.

Council of Science Editors:

Paulick NA. Amenability Of Cayley graphs Through Use Of Folner's Conditions. [Masters Thesis]. University of Windsor; 2020. Available from: https://scholar.uwindsor.ca/etd/8307

University of Newcastle

10. Wang, Mujiangshan. Reliability of interconnection networks.

Degree: PhD, 2019, University of Newcastle

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

►

Research Doctorate - Doctor of Philosophy (PhD)

*Graph* is a type of mathematical model to study the relationships among entities. The theory on graphs is…
(more)

Subjects/Keywords: interconnection network; graph; diagnosability; PMC model; MM∗ model; Cayley graph; 1-Good-neighbour diagnosability

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Wang, M. (2019). Reliability of interconnection networks. (Doctoral Dissertation). University of Newcastle. Retrieved from http://hdl.handle.net/1959.13/1404487

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

Wang, Mujiangshan. “Reliability of interconnection networks.” 2019. Doctoral Dissertation, University of Newcastle. Accessed March 09, 2021. http://hdl.handle.net/1959.13/1404487.

MLA Handbook (7^{th} Edition):

Wang, Mujiangshan. “Reliability of interconnection networks.” 2019. Web. 09 Mar 2021.

Vancouver:

Wang M. Reliability of interconnection networks. [Internet] [Doctoral dissertation]. University of Newcastle; 2019. [cited 2021 Mar 09]. Available from: http://hdl.handle.net/1959.13/1404487.

Council of Science Editors:

Wang M. Reliability of interconnection networks. [Doctoral Dissertation]. University of Newcastle; 2019. Available from: http://hdl.handle.net/1959.13/1404487

University of Delaware

11. Sun, Shuying. On some families of algebraically defined graphs .

Degree: 2017, University of Delaware

URL: http://udspace.udel.edu/handle/19716/21793

This thesis is concerned with the study of some families of graphs dened by systems of polynomial equations over nite elds. We explore the girth and diameter of some special classes of these graphs, along with their expansion properties.

Subjects/Keywords: Pure sciences; Cayley graph; Cover of a graph; Degenerate turan-type problems; Expander graph; Girth; Graph spectrum

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Sun, S. (2017). On some families of algebraically defined graphs . (Doctoral Dissertation). University of Delaware. Retrieved from http://udspace.udel.edu/handle/19716/21793

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

Sun, Shuying. “On some families of algebraically defined graphs .” 2017. Doctoral Dissertation, University of Delaware. Accessed March 09, 2021. http://udspace.udel.edu/handle/19716/21793.

MLA Handbook (7^{th} Edition):

Sun, Shuying. “On some families of algebraically defined graphs .” 2017. Web. 09 Mar 2021.

Vancouver:

Sun S. On some families of algebraically defined graphs . [Internet] [Doctoral dissertation]. University of Delaware; 2017. [cited 2021 Mar 09]. Available from: http://udspace.udel.edu/handle/19716/21793.

Council of Science Editors:

Sun S. On some families of algebraically defined graphs . [Doctoral Dissertation]. University of Delaware; 2017. Available from: http://udspace.udel.edu/handle/19716/21793

12. Martineau, Sébastien. Percolation sur les groupes et modèles dirigés : Percolation on groups and directed models.

Degree: Docteur es, Mathématiques, 2014, Lyon, École normale supérieure

URL: http://www.theses.fr/2014ENSL0959

►

Cette thèse porte sur deux types de problèmes de mécanique statistique : il y est question de percolation sur les groupes et de modèles dirigés.… (more)

Subjects/Keywords: Graphe de Cayley; DLA; Équivalence orbitale; Indistinguabilité; Localité; Percolation; Cayley graph; DLA; Indistinguishability; Locality; Orbit equivalence; Percolation

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Martineau, S. (2014). Percolation sur les groupes et modèles dirigés : Percolation on groups and directed models. (Doctoral Dissertation). Lyon, École normale supérieure. Retrieved from http://www.theses.fr/2014ENSL0959

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

Martineau, Sébastien. “Percolation sur les groupes et modèles dirigés : Percolation on groups and directed models.” 2014. Doctoral Dissertation, Lyon, École normale supérieure. Accessed March 09, 2021. http://www.theses.fr/2014ENSL0959.

MLA Handbook (7^{th} Edition):

Martineau, Sébastien. “Percolation sur les groupes et modèles dirigés : Percolation on groups and directed models.” 2014. Web. 09 Mar 2021.

Vancouver:

Martineau S. Percolation sur les groupes et modèles dirigés : Percolation on groups and directed models. [Internet] [Doctoral dissertation]. Lyon, École normale supérieure; 2014. [cited 2021 Mar 09]. Available from: http://www.theses.fr/2014ENSL0959.

Council of Science Editors:

Martineau S. Percolation sur les groupes et modèles dirigés : Percolation on groups and directed models. [Doctoral Dissertation]. Lyon, École normale supérieure; 2014. Available from: http://www.theses.fr/2014ENSL0959

13. Awang, Jennifer S. Dots and lines : geometric semigroup theory and finite presentability .

Degree: 2015, University of St. Andrews

URL: http://hdl.handle.net/10023/6923

► Geometric semigroup theory means different things to different people, but it is agreed that it involves associating a geometric structure to a semigroup and deducing…
(more)

Subjects/Keywords: Semigroups; Cayley graph; Finite presentability

…x5D;. A
popular choice for a geometric structure is the *Cayley* *graph* of a semigroup, which… …a labelling function λ : E → A, from some set of labels A.
The *Cayley* *graph* of a semigroup… …ι, τ, λ) be the
*Cayley* *graph* of S with respect to A. We define a new set of edges
F… …undirected version of the *Cayley* *graph* and removing any multiple edges or
loops that occur.
Theorem… …An important definition for us is that of the *Cayley* *graph*, which allows us to associate a…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Awang, J. S. (2015). Dots and lines : geometric semigroup theory and finite presentability . (Thesis). University of St. Andrews. Retrieved from http://hdl.handle.net/10023/6923

Not specified: Masters Thesis or Doctoral Dissertation

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

Awang, Jennifer S. “Dots and lines : geometric semigroup theory and finite presentability .” 2015. Thesis, University of St. Andrews. Accessed March 09, 2021. http://hdl.handle.net/10023/6923.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Awang, Jennifer S. “Dots and lines : geometric semigroup theory and finite presentability .” 2015. Web. 09 Mar 2021.

Vancouver:

Awang JS. Dots and lines : geometric semigroup theory and finite presentability . [Internet] [Thesis]. University of St. Andrews; 2015. [cited 2021 Mar 09]. Available from: http://hdl.handle.net/10023/6923.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Awang JS. Dots and lines : geometric semigroup theory and finite presentability . [Thesis]. University of St. Andrews; 2015. Available from: http://hdl.handle.net/10023/6923

Not specified: Masters Thesis or Doctoral Dissertation

University of South Florida

14. Walker, DayVon L. Power Graphs of Quasigroups.

Degree: 2019, University of South Florida

URL: https://scholarcommons.usf.edu/etd/7984

► We investigate power graphs of quasigroups. The power *graph* of a quasigroup takes the elements of the quasigroup as its vertices, and there is an…
(more)

Subjects/Keywords: Cayley Table; directed left power graph; forbidden subgraphs; Latin square; sinks; Mathematics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Walker, D. L. (2019). Power Graphs of Quasigroups. (Thesis). University of South Florida. Retrieved from https://scholarcommons.usf.edu/etd/7984

Not specified: Masters Thesis or Doctoral Dissertation

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

Walker, DayVon L. “Power Graphs of Quasigroups.” 2019. Thesis, University of South Florida. Accessed March 09, 2021. https://scholarcommons.usf.edu/etd/7984.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Walker, DayVon L. “Power Graphs of Quasigroups.” 2019. Web. 09 Mar 2021.

Vancouver:

Walker DL. Power Graphs of Quasigroups. [Internet] [Thesis]. University of South Florida; 2019. [cited 2021 Mar 09]. Available from: https://scholarcommons.usf.edu/etd/7984.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Walker DL. Power Graphs of Quasigroups. [Thesis]. University of South Florida; 2019. Available from: https://scholarcommons.usf.edu/etd/7984

Not specified: Masters Thesis or Doctoral Dissertation

University of Georgia

15.
Ramyaa, Ramyaa.
Finding Hamilton cycles in cubic digraphs and restricted *Cayley* digraphs.

Degree: 2014, University of Georgia

URL: http://hdl.handle.net/10724/21946

► This thesis explores randomized algorithms for finding Hamilton cycles in cubic digraphs and in diregular *Cayley* digraphs of degree 2 in which one generator is…
(more)

Subjects/Keywords: cubic digraph; Cayley graph; Hamilton cycle; perfect matching; alternating cycle; Markov chain; randomized algorithm

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Ramyaa, R. (2014). Finding Hamilton cycles in cubic digraphs and restricted Cayley digraphs. (Thesis). University of Georgia. Retrieved from http://hdl.handle.net/10724/21946

Not specified: Masters Thesis or Doctoral Dissertation

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

Ramyaa, Ramyaa. “Finding Hamilton cycles in cubic digraphs and restricted Cayley digraphs.” 2014. Thesis, University of Georgia. Accessed March 09, 2021. http://hdl.handle.net/10724/21946.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Ramyaa, Ramyaa. “Finding Hamilton cycles in cubic digraphs and restricted Cayley digraphs.” 2014. Web. 09 Mar 2021.

Vancouver:

Ramyaa R. Finding Hamilton cycles in cubic digraphs and restricted Cayley digraphs. [Internet] [Thesis]. University of Georgia; 2014. [cited 2021 Mar 09]. Available from: http://hdl.handle.net/10724/21946.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Ramyaa R. Finding Hamilton cycles in cubic digraphs and restricted Cayley digraphs. [Thesis]. University of Georgia; 2014. Available from: http://hdl.handle.net/10724/21946

Not specified: Masters Thesis or Doctoral Dissertation

McMaster University

16. Shen, ShengWei. On the Parallelization of a Search for Counterexamples to a Conjecture of Erd\H{o}s.

Degree: MSc, 2012, McMaster University

URL: http://hdl.handle.net/11375/12491

►

Denote by k_{t}(G) the number of cliques of order t in a *graph* G having n vertices. Let k_{t}(n) = \min{k_{t}(G)+k_{t}(G̅) } where G̅…
(more)

Subjects/Keywords: clique; coclique; Cayley graph; complete graph; subgraph; parallelization; Computer Sciences; Discrete Mathematics and Combinatorics; Theory and Algorithms; Computer Sciences

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Shen, S. (2012). On the Parallelization of a Search for Counterexamples to a Conjecture of Erd\H{o}s. (Masters Thesis). McMaster University. Retrieved from http://hdl.handle.net/11375/12491

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

Shen, ShengWei. “On the Parallelization of a Search for Counterexamples to a Conjecture of Erd\H{o}s.” 2012. Masters Thesis, McMaster University. Accessed March 09, 2021. http://hdl.handle.net/11375/12491.

MLA Handbook (7^{th} Edition):

Shen, ShengWei. “On the Parallelization of a Search for Counterexamples to a Conjecture of Erd\H{o}s.” 2012. Web. 09 Mar 2021.

Vancouver:

Shen S. On the Parallelization of a Search for Counterexamples to a Conjecture of Erd\H{o}s. [Internet] [Masters thesis]. McMaster University; 2012. [cited 2021 Mar 09]. Available from: http://hdl.handle.net/11375/12491.

Council of Science Editors:

Shen S. On the Parallelization of a Search for Counterexamples to a Conjecture of Erd\H{o}s. [Masters Thesis]. McMaster University; 2012. Available from: http://hdl.handle.net/11375/12491

University of Maine

17. Vaccaro, Isaac L. Gray Codes in Music Theory.

Degree: MA, Mathematics, 2020, University of Maine

URL: https://digitalcommons.library.umaine.edu/etd/3165

► In the branch of Western music theory called serialism, it is desirable to construct chord progressions that use each chord in a chosen set…
(more)

Subjects/Keywords: Gray code; Hamiltonian path; Schreier graph; Cayley graph; Serialism; Algebra; Discrete Mathematics and Combinatorics; Music Theory

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Vaccaro, I. L. (2020). Gray Codes in Music Theory. (Masters Thesis). University of Maine. Retrieved from https://digitalcommons.library.umaine.edu/etd/3165

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

Vaccaro, Isaac L. “Gray Codes in Music Theory.” 2020. Masters Thesis, University of Maine. Accessed March 09, 2021. https://digitalcommons.library.umaine.edu/etd/3165.

MLA Handbook (7^{th} Edition):

Vaccaro, Isaac L. “Gray Codes in Music Theory.” 2020. Web. 09 Mar 2021.

Vancouver:

Vaccaro IL. Gray Codes in Music Theory. [Internet] [Masters thesis]. University of Maine; 2020. [cited 2021 Mar 09]. Available from: https://digitalcommons.library.umaine.edu/etd/3165.

Council of Science Editors:

Vaccaro IL. Gray Codes in Music Theory. [Masters Thesis]. University of Maine; 2020. Available from: https://digitalcommons.library.umaine.edu/etd/3165

18.
TERRY LAU SHUE CHIEN.
* CAYLEY* GRAPHS AND APPLICATIONS OF POWER SUM SYMMETRIC FUNCTION.

Degree: 2013, National University of Singapore

URL: http://scholarbank.nus.edu.sg/handle/10635/43526

Subjects/Keywords: Cayley Graph; Graph Theory; Symmetric Functions; Independent Set

Record Details Similar Records

❌

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

APA (6^{th} Edition):

CHIEN, T. L. S. (2013). CAYLEY GRAPHS AND APPLICATIONS OF POWER SUM SYMMETRIC FUNCTION. (Thesis). National University of Singapore. Retrieved from http://scholarbank.nus.edu.sg/handle/10635/43526

Not specified: Masters Thesis or Doctoral Dissertation

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

CHIEN, TERRY LAU SHUE. “CAYLEY GRAPHS AND APPLICATIONS OF POWER SUM SYMMETRIC FUNCTION.” 2013. Thesis, National University of Singapore. Accessed March 09, 2021. http://scholarbank.nus.edu.sg/handle/10635/43526.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

CHIEN, TERRY LAU SHUE. “CAYLEY GRAPHS AND APPLICATIONS OF POWER SUM SYMMETRIC FUNCTION.” 2013. Web. 09 Mar 2021.

Vancouver:

CHIEN TLS. CAYLEY GRAPHS AND APPLICATIONS OF POWER SUM SYMMETRIC FUNCTION. [Internet] [Thesis]. National University of Singapore; 2013. [cited 2021 Mar 09]. Available from: http://scholarbank.nus.edu.sg/handle/10635/43526.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

CHIEN TLS. CAYLEY GRAPHS AND APPLICATIONS OF POWER SUM SYMMETRIC FUNCTION. [Thesis]. National University of Singapore; 2013. Available from: http://scholarbank.nus.edu.sg/handle/10635/43526

Not specified: Masters Thesis or Doctoral Dissertation

19. Badaoui, Mohamad. G-graphs and Expander graphs : G-graphes et les graphes d’expansion.

Degree: Docteur es, Informatique, 2018, Normandie; Université libanaise

URL: http://www.theses.fr/2018NORMC207

►

L’utilisation de l’algèbre pour résoudre des problèmes de graphes a conduit au développement de trois branches : théorie spectrale des graphes, géométrie et combinatoire des… (more)

Subjects/Keywords: Famille d’expansion; Graphe de Cayley; G-graphe; Théorie algébrique des graphes; Graphe de Ramanujan; Graphe intégral; Hypergraph theory; Expander family; Cayley graph; G-graph; Algebraic graph theory; Combinatorial theory; Ramanujan graph; Integral graph

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Badaoui, M. (2018). G-graphs and Expander graphs : G-graphes et les graphes d’expansion. (Doctoral Dissertation). Normandie; Université libanaise. Retrieved from http://www.theses.fr/2018NORMC207

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

Badaoui, Mohamad. “G-graphs and Expander graphs : G-graphes et les graphes d’expansion.” 2018. Doctoral Dissertation, Normandie; Université libanaise. Accessed March 09, 2021. http://www.theses.fr/2018NORMC207.

MLA Handbook (7^{th} Edition):

Badaoui, Mohamad. “G-graphs and Expander graphs : G-graphes et les graphes d’expansion.” 2018. Web. 09 Mar 2021.

Vancouver:

Badaoui M. G-graphs and Expander graphs : G-graphes et les graphes d’expansion. [Internet] [Doctoral dissertation]. Normandie; Université libanaise; 2018. [cited 2021 Mar 09]. Available from: http://www.theses.fr/2018NORMC207.

Council of Science Editors:

Badaoui M. G-graphs and Expander graphs : G-graphes et les graphes d’expansion. [Doctoral Dissertation]. Normandie; Université libanaise; 2018. Available from: http://www.theses.fr/2018NORMC207

20. Biswas, Arindam. Théorie des groupes approximatifs et ses applications : Theory of approximate groups and its applications.

Degree: Docteur es, Mathématiques fondamentales, 2016, Université Paris-Saclay (ComUE)

URL: http://www.theses.fr/2016SACLS573

►

Dans la premier partie de cette thèse, nous étudions la structure des sous-groupes approximatifs dans les groupes metabéliens (groupes résolubles de classe de résolubilité 2)… (more)

Subjects/Keywords: Groupes approximatifs; Diamètre d'un groupe fini; Graphe de Cayley; Combinatoire additive; Boucles des moufang; Approximate groups; Diameter of finite groups; Cayley graph; Additive combinatorics; Moufang loops

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Biswas, A. (2016). Théorie des groupes approximatifs et ses applications : Theory of approximate groups and its applications. (Doctoral Dissertation). Université Paris-Saclay (ComUE). Retrieved from http://www.theses.fr/2016SACLS573

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

Biswas, Arindam. “Théorie des groupes approximatifs et ses applications : Theory of approximate groups and its applications.” 2016. Doctoral Dissertation, Université Paris-Saclay (ComUE). Accessed March 09, 2021. http://www.theses.fr/2016SACLS573.

MLA Handbook (7^{th} Edition):

Biswas, Arindam. “Théorie des groupes approximatifs et ses applications : Theory of approximate groups and its applications.” 2016. Web. 09 Mar 2021.

Vancouver:

Biswas A. Théorie des groupes approximatifs et ses applications : Theory of approximate groups and its applications. [Internet] [Doctoral dissertation]. Université Paris-Saclay (ComUE); 2016. [cited 2021 Mar 09]. Available from: http://www.theses.fr/2016SACLS573.

Council of Science Editors:

Biswas A. Théorie des groupes approximatifs et ses applications : Theory of approximate groups and its applications. [Doctoral Dissertation]. Université Paris-Saclay (ComUE); 2016. Available from: http://www.theses.fr/2016SACLS573

University of Alabama

21. Bishop-Ross, Rachel. The road trip property: an aid in classifying groups with quadratic isoperimetric inequalities.

Degree: 2012, University of Alabama

URL: http://purl.lib.ua.edu/55014

► A property of geodesic metric spaces, called the road trip property, that generalizes hyperbolic and convex metric spaces is introduced. This property is shown to…
(more)

Subjects/Keywords: Electronic Thesis or Dissertation; – thesis; Mathematics; Cayley graph; convex metric space; Dehn function; geodesic metric space; quadratic isoperimetric inequality; quasi-isometry

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Bishop-Ross, R. (2012). The road trip property: an aid in classifying groups with quadratic isoperimetric inequalities. (Thesis). University of Alabama. Retrieved from http://purl.lib.ua.edu/55014

Not specified: Masters Thesis or Doctoral Dissertation

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

Bishop-Ross, Rachel. “The road trip property: an aid in classifying groups with quadratic isoperimetric inequalities.” 2012. Thesis, University of Alabama. Accessed March 09, 2021. http://purl.lib.ua.edu/55014.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Bishop-Ross, Rachel. “The road trip property: an aid in classifying groups with quadratic isoperimetric inequalities.” 2012. Web. 09 Mar 2021.

Vancouver:

Bishop-Ross R. The road trip property: an aid in classifying groups with quadratic isoperimetric inequalities. [Internet] [Thesis]. University of Alabama; 2012. [cited 2021 Mar 09]. Available from: http://purl.lib.ua.edu/55014.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Bishop-Ross R. The road trip property: an aid in classifying groups with quadratic isoperimetric inequalities. [Thesis]. University of Alabama; 2012. Available from: http://purl.lib.ua.edu/55014

Not specified: Masters Thesis or Doctoral Dissertation

Michigan Technological University

22. Pastine, Adrian. Two Problems of Gerhard Ringel.

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

URL: https://digitalcommons.mtu.edu/etdr/199

► Gerhard Ringel was an Austrian Mathematician, and is regarded as one of the most influential *graph* theorists of the twentieth century. This work deals…
(more)

Subjects/Keywords: Graph decomposition; cycles in graphs; Hamilton-Waterloo Problem; R-Sequences; Complete Equipartite Graphs; Cayley Graphs; Discrete Mathematics and Combinatorics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Pastine, A. (2016). Two Problems of Gerhard Ringel. (Doctoral Dissertation). Michigan Technological University. Retrieved from https://digitalcommons.mtu.edu/etdr/199

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

Pastine, Adrian. “Two Problems of Gerhard Ringel.” 2016. Doctoral Dissertation, Michigan Technological University. Accessed March 09, 2021. https://digitalcommons.mtu.edu/etdr/199.

MLA Handbook (7^{th} Edition):

Pastine, Adrian. “Two Problems of Gerhard Ringel.” 2016. Web. 09 Mar 2021.

Vancouver:

Pastine A. Two Problems of Gerhard Ringel. [Internet] [Doctoral dissertation]. Michigan Technological University; 2016. [cited 2021 Mar 09]. Available from: https://digitalcommons.mtu.edu/etdr/199.

Council of Science Editors:

Pastine A. Two Problems of Gerhard Ringel. [Doctoral Dissertation]. Michigan Technological University; 2016. Available from: https://digitalcommons.mtu.edu/etdr/199

University of Tasmania

23. Quinn, SJ. Directed graphs and combinatorial properties of groups and semigroups.

Degree: 2002, University of Tasmania

URL: https://eprints.utas.edu.au/21303/1/whole_QuinnStephenJohn2002_thesis.pdf

► This thesis is a study of several combinatorial properties of groups and semigroups. Research on combinatorial properties on groups and semigroups with all infinite subsets…
(more)

Subjects/Keywords: Cayley graphs; Group theory; Semigroups; Ramsey theory; Graph theory

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Quinn, S. (2002). Directed graphs and combinatorial properties of groups and semigroups. (Thesis). University of Tasmania. Retrieved from https://eprints.utas.edu.au/21303/1/whole_QuinnStephenJohn2002_thesis.pdf

Not specified: Masters Thesis or Doctoral Dissertation

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

Quinn, SJ. “Directed graphs and combinatorial properties of groups and semigroups.” 2002. Thesis, University of Tasmania. Accessed March 09, 2021. https://eprints.utas.edu.au/21303/1/whole_QuinnStephenJohn2002_thesis.pdf.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Quinn, SJ. “Directed graphs and combinatorial properties of groups and semigroups.” 2002. Web. 09 Mar 2021.

Vancouver:

Quinn S. Directed graphs and combinatorial properties of groups and semigroups. [Internet] [Thesis]. University of Tasmania; 2002. [cited 2021 Mar 09]. Available from: https://eprints.utas.edu.au/21303/1/whole_QuinnStephenJohn2002_thesis.pdf.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Quinn S. Directed graphs and combinatorial properties of groups and semigroups. [Thesis]. University of Tasmania; 2002. Available from: https://eprints.utas.edu.au/21303/1/whole_QuinnStephenJohn2002_thesis.pdf

Not specified: Masters Thesis or Doctoral Dissertation

Université Paris-Sud – Paris XI

24. He, Weihua. Cycles in graphs and arc colorings in digraphs : Cycles des graphes et colorations d’arcs des digraphes.

Degree: Docteur es, Informatique, 2014, Université Paris-Sud – Paris XI

URL: http://www.theses.fr/2014PA112352

►

Dans cette thèse nous étudions quatre problèmes de théorie des graphes. En particulier,Nous étudions le problème du cycle hamiltonien dans les line graphes, et aussi… (more)

Subjects/Keywords: Cycle Hamiltonien; Line graphes; Bipancyclicité; Graphes de Cayley; Coloration des arcs sommet-distinguant; Coloration acyclique des arcs; Hamiltonian cycle; Line graph; Bipancyclicity; Cayley graph; Vertex-distinguishing arc coloring; Acyclic arc coloring

Record Details Similar Records

❌

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

APA (6^{th} Edition):

He, W. (2014). Cycles in graphs and arc colorings in digraphs : Cycles des graphes et colorations d’arcs des digraphes. (Doctoral Dissertation). Université Paris-Sud – Paris XI. Retrieved from http://www.theses.fr/2014PA112352

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

He, Weihua. “Cycles in graphs and arc colorings in digraphs : Cycles des graphes et colorations d’arcs des digraphes.” 2014. Doctoral Dissertation, Université Paris-Sud – Paris XI. Accessed March 09, 2021. http://www.theses.fr/2014PA112352.

MLA Handbook (7^{th} Edition):

He, Weihua. “Cycles in graphs and arc colorings in digraphs : Cycles des graphes et colorations d’arcs des digraphes.” 2014. Web. 09 Mar 2021.

Vancouver:

He W. Cycles in graphs and arc colorings in digraphs : Cycles des graphes et colorations d’arcs des digraphes. [Internet] [Doctoral dissertation]. Université Paris-Sud – Paris XI; 2014. [cited 2021 Mar 09]. Available from: http://www.theses.fr/2014PA112352.

Council of Science Editors:

He W. Cycles in graphs and arc colorings in digraphs : Cycles des graphes et colorations d’arcs des digraphes. [Doctoral Dissertation]. Université Paris-Sud – Paris XI; 2014. Available from: http://www.theses.fr/2014PA112352

Mississippi State University

25.
Balasubramanian, Suman.
ON THE ERDŐSSÓS CONJECTURE AND THE *CAYLEY* ISOMORPHISM PROBLEM.

Degree: PhD, Mathematics and Statistics, 2009, Mississippi State University

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

► We study the Erdős- Sòs conjecture that states that every *graph* of average degree greater than k-1 contains every tree of order k+1. While the…
(more)

Subjects/Keywords: Cayley graph; (pq r)metacirculant; Tree; K<; sub>; 2 s<; /sub>;

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Balasubramanian, S. (2009). ON THE ERDŐSSÓS CONJECTURE AND THE CAYLEY ISOMORPHISM PROBLEM. (Doctoral Dissertation). Mississippi State University. Retrieved from http://sun.library.msstate.edu/ETD-db/theses/available/etd-07102009-113145/ ;

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

Balasubramanian, Suman. “ON THE ERDŐSSÓS CONJECTURE AND THE CAYLEY ISOMORPHISM PROBLEM.” 2009. Doctoral Dissertation, Mississippi State University. Accessed March 09, 2021. http://sun.library.msstate.edu/ETD-db/theses/available/etd-07102009-113145/ ;.

MLA Handbook (7^{th} Edition):

Balasubramanian, Suman. “ON THE ERDŐSSÓS CONJECTURE AND THE CAYLEY ISOMORPHISM PROBLEM.” 2009. Web. 09 Mar 2021.

Vancouver:

Balasubramanian S. ON THE ERDŐSSÓS CONJECTURE AND THE CAYLEY ISOMORPHISM PROBLEM. [Internet] [Doctoral dissertation]. Mississippi State University; 2009. [cited 2021 Mar 09]. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-07102009-113145/ ;.

Council of Science Editors:

Balasubramanian S. ON THE ERDŐSSÓS CONJECTURE AND THE CAYLEY ISOMORPHISM PROBLEM. [Doctoral Dissertation]. Mississippi State University; 2009. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-07102009-113145/ ;

26. Das, Kajal. On Uniform and integrable measure equivalence between discrete groups : Sur l'équivalence mesurée uniforme et intégrable entre groupes discrets.

Degree: Docteur es, Mathématiques, 2016, Lyon

URL: http://www.theses.fr/2016LYSEN023

►

Ma thèse se situe à l'intersection de la théorie des groupes géométrique et la théorie des groupes mesurée. Une question majeure dans la théorie des… (more)

Subjects/Keywords: Groupes discrets; Graphe de Cayley; Quasi-isometrie; Equivalence mesurée; Groupes de surface; Groupes résiduellement finis; Espaces de boîtes; Expandeurs; Discrete groups; Cayley graph; Quasi-isometry; Measure equivalence; Surface groups; Residual finite groups; Box spaces; Expanders

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Das, K. (2016). On Uniform and integrable measure equivalence between discrete groups : Sur l'équivalence mesurée uniforme et intégrable entre groupes discrets. (Doctoral Dissertation). Lyon. Retrieved from http://www.theses.fr/2016LYSEN023

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

Das, Kajal. “On Uniform and integrable measure equivalence between discrete groups : Sur l'équivalence mesurée uniforme et intégrable entre groupes discrets.” 2016. Doctoral Dissertation, Lyon. Accessed March 09, 2021. http://www.theses.fr/2016LYSEN023.

MLA Handbook (7^{th} Edition):

Das, Kajal. “On Uniform and integrable measure equivalence between discrete groups : Sur l'équivalence mesurée uniforme et intégrable entre groupes discrets.” 2016. Web. 09 Mar 2021.

Vancouver:

Das K. On Uniform and integrable measure equivalence between discrete groups : Sur l'équivalence mesurée uniforme et intégrable entre groupes discrets. [Internet] [Doctoral dissertation]. Lyon; 2016. [cited 2021 Mar 09]. Available from: http://www.theses.fr/2016LYSEN023.

Council of Science Editors:

Das K. On Uniform and integrable measure equivalence between discrete groups : Sur l'équivalence mesurée uniforme et intégrable entre groupes discrets. [Doctoral Dissertation]. Lyon; 2016. Available from: http://www.theses.fr/2016LYSEN023

27.
da Cunha, Aubrey.
Turing Machines, *Cayley* Graphs, and Inescapable Groups.

Degree: PhD, Mathematics, 2012, University of Michigan

URL: http://hdl.handle.net/2027.42/94057

► We present a generalization of standard Turing machines based on allowing unusual tapes. We present a set of reasonable constraints on tape geometry and conclude…
(more)

Subjects/Keywords: Turing Machine; Cayley Graph; Turing Degree; Computability; Mathematics; Science

…suﬃcient conditions for the *graph* to be the *Cayley* *graph* of a ﬁnitely generated,
inﬁnite group… …depend on the structure of the group from which the *Cayley*
*graph* is generated. For groups with… …open problem for some time.
1.1
Notation and Terminology
The *Cayley* *graph* of a group, G… …the *Cayley* *graph* of an inﬁnite,
ﬁnitely-generated group relative to a symmetric generating… …simply point out that restrictions 1 and 6 imply that our tape is a *Cayley* *graph*,
restrictions…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

da Cunha, A. (2012). Turing Machines, Cayley Graphs, and Inescapable Groups. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/94057

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

da Cunha, Aubrey. “Turing Machines, Cayley Graphs, and Inescapable Groups.” 2012. Doctoral Dissertation, University of Michigan. Accessed March 09, 2021. http://hdl.handle.net/2027.42/94057.

MLA Handbook (7^{th} Edition):

da Cunha, Aubrey. “Turing Machines, Cayley Graphs, and Inescapable Groups.” 2012. Web. 09 Mar 2021.

Vancouver:

da Cunha A. Turing Machines, Cayley Graphs, and Inescapable Groups. [Internet] [Doctoral dissertation]. University of Michigan; 2012. [cited 2021 Mar 09]. Available from: http://hdl.handle.net/2027.42/94057.

Council of Science Editors:

da Cunha A. Turing Machines, Cayley Graphs, and Inescapable Groups. [Doctoral Dissertation]. University of Michigan; 2012. Available from: http://hdl.handle.net/2027.42/94057

Cornell University

28. Bode, Jason S. Isoperimetric Constants and Self-Avoiding Walks and Polygons on Hyperbolic Coxeter Groups.

Degree: 2007, Cornell University

URL: http://hdl.handle.net/1813/7522

► We study isoperimetric constants of and self-avoiding walks (SAWs) and self-avoiding polygons (SAPs) on *Cayley* graphs of hyperbolic Coxeter groups. These graphs are tilings of…
(more)

Subjects/Keywords: Isoperimetric; Self-Avoiding Walk; Self-Avoiding Polygon; Hyperbolic Group; Coxeter Group; Cayley Graph; Hyperbolic; Graph

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Bode, J. S. (2007). Isoperimetric Constants and Self-Avoiding Walks and Polygons on Hyperbolic Coxeter Groups. (Thesis). Cornell University. Retrieved from http://hdl.handle.net/1813/7522

Not specified: Masters Thesis or Doctoral Dissertation

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

Bode, Jason S. “Isoperimetric Constants and Self-Avoiding Walks and Polygons on Hyperbolic Coxeter Groups.” 2007. Thesis, Cornell University. Accessed March 09, 2021. http://hdl.handle.net/1813/7522.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Bode, Jason S. “Isoperimetric Constants and Self-Avoiding Walks and Polygons on Hyperbolic Coxeter Groups.” 2007. Web. 09 Mar 2021.

Vancouver:

Bode JS. Isoperimetric Constants and Self-Avoiding Walks and Polygons on Hyperbolic Coxeter Groups. [Internet] [Thesis]. Cornell University; 2007. [cited 2021 Mar 09]. Available from: http://hdl.handle.net/1813/7522.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Bode JS. Isoperimetric Constants and Self-Avoiding Walks and Polygons on Hyperbolic Coxeter Groups. [Thesis]. Cornell University; 2007. Available from: http://hdl.handle.net/1813/7522

Not specified: Masters Thesis or Doctoral Dissertation

29. Bhoumik, Soumya. On the automorphism groups of almost all circulant graphs and digraphs.

Degree: PhD, Mathematics and Statistics, 2013, Mississippi State University

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

► We attempt to determine the structure of the automorphism group of a generic circulant *graph*. We first show that almost all circulant graphs have…
(more)

Subjects/Keywords: Nor- mal; Small; GRR; DRR; Asymptotic automorphism group; Cayley (di)graph; Non-normal Circulants

…*Cayley* (di)*graph* of G with connection set S
Γ1 Γ2
Wreath product of two graphs Γ1… …automorphisms of a *Cayley* *graph*, which ensures vertex-transitivity. The converse is
not true, for… …example Peterson *graph* is vertex-transitive but not a *Cayley* *graph* for any
group.
In recent… …for the *Cayley* *graph* of a cyclic group.
3
CHAPTER 2
ON THE AUTOMORPHISM GROUPS OF ALMOST… …Watkins in [32]: for a group G, does there exist at least one *Cayley* *graph* Γ
of G such…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Bhoumik, S. (2013). On the automorphism groups of almost all circulant graphs and digraphs. (Doctoral Dissertation). Mississippi State University. Retrieved from http://sun.library.msstate.edu/ETD-db/theses/available/etd-06042013-125759/ ;

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

Bhoumik, Soumya. “On the automorphism groups of almost all circulant graphs and digraphs.” 2013. Doctoral Dissertation, Mississippi State University. Accessed March 09, 2021. http://sun.library.msstate.edu/ETD-db/theses/available/etd-06042013-125759/ ;.

MLA Handbook (7^{th} Edition):

Bhoumik, Soumya. “On the automorphism groups of almost all circulant graphs and digraphs.” 2013. Web. 09 Mar 2021.

Vancouver:

Bhoumik S. On the automorphism groups of almost all circulant graphs and digraphs. [Internet] [Doctoral dissertation]. Mississippi State University; 2013. [cited 2021 Mar 09]. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-06042013-125759/ ;.

Council of Science Editors:

Bhoumik S. On the automorphism groups of almost all circulant graphs and digraphs. [Doctoral Dissertation]. Mississippi State University; 2013. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-06042013-125759/ ;

30. Artemenko, Igor. On Weak Limits and Unimodular Measures .

Degree: 2014, University of Ottawa

URL: http://hdl.handle.net/10393/30417

► In this thesis, the main objects of study are probability measures on the isomorphism classes of countable, connected rooted graphs. An important class of such…
(more)

Subjects/Keywords: tree; automorphism; group; ball; path; connected; component; rooted; birooted; graph; Cayley; converges weakly; extreme point; mass transport principle; involution invariance; law; neighbourhood; orbit; rigid; subgraph; unimodular; unimodularity; vertex-transitive; walk; weak limit; weak convergence; probability; measure; barred binary tree; bi-infinite path; first ancestor; judicial; lawless; negligible; stabilizer; sustained; strictly sustained; random graph

…Let X
be an infinite connected *graph*, and let x ∈ V (X). The sequence (Ψ(… …not have a weak limit. Furthermore,
it is possible to construct an infinite connected *graph*… …determine if a countable connected *graph* is
judicial without reference to a measure, and whether… …every extreme point of U is a
unimodular measure sustained by a connected *graph*.
3
1… …between a
*graph* and its isomorphism class. That is, whenever X and Y are graphs, X and Y are…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Artemenko, I. (2014). On Weak Limits and Unimodular Measures . (Thesis). University of Ottawa. Retrieved from http://hdl.handle.net/10393/30417

Not specified: Masters Thesis or Doctoral Dissertation

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

Artemenko, Igor. “On Weak Limits and Unimodular Measures .” 2014. Thesis, University of Ottawa. Accessed March 09, 2021. http://hdl.handle.net/10393/30417.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Artemenko, Igor. “On Weak Limits and Unimodular Measures .” 2014. Web. 09 Mar 2021.

Vancouver:

Artemenko I. On Weak Limits and Unimodular Measures . [Internet] [Thesis]. University of Ottawa; 2014. [cited 2021 Mar 09]. Available from: http://hdl.handle.net/10393/30417.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Artemenko I. On Weak Limits and Unimodular Measures . [Thesis]. University of Ottawa; 2014. Available from: http://hdl.handle.net/10393/30417

Not specified: Masters Thesis or Doctoral Dissertation