Advanced search options

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

You searched for `subject:(Graphs)`

.
Showing records 1 – 30 of
1515 total matches.

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

Search Limiters

Dates

- 2016 – 2020 (413)
- 2011 – 2015 (651)
- 2006 – 2010 (336)
- 2001 – 2005 (93)
- 1996 – 2000 (23)
- 1991 – 1995 (35)
- 1986 – 1990 (30)
- 1981 – 1985 (18)

Universities

- Brno University of Technology (53)
- Indian Institute of Science (41)
- University of São Paulo (40)
- University of Waterloo (40)
- ETH Zürich (33)
- University of Illinois – Urbana-Champaign (31)
- University of Florida (26)
- Michigan State University (25)
- Georgia Tech (24)
- Manonmaniam Sundaranar University (24)
- Pontifical Catholic University of Rio de Janeiro (22)
- Texas A&M University (22)
- The Ohio State University (20)
- University of Victoria (19)
- University of Oxford (17)

Department

- Mathematics (109)
- Informatique (77)
- Computer Science (66)
- Applied Mathematics (24)
- Mathématiques (21)
- Electrical and Computer Engineering (17)
- Ciência da Computação (16)
- Department of Mechanical Engineering (16)
- Mathematical Sciences (16)
- Computer Science and Engineering (13)

Degrees

- PhD (306)
- Docteur es (164)
- MS (115)
- Mestrado (31)
- Master (16)

Country

- US (503)
- France (164)
- Brazil (123)
- Canada (121)
- India (113)
- Greece (54)
- Czech Republic (53)
- UK (53)
- Netherlands (40)
- Australia (39)
- South Africa (38)
- Switzerland (34)
- Sweden (34)
- si (16)
- Spain (15)

▼ Search Limiters

1.
Arvind, N R.
Forbidden subgraph colorings, oriented colorings and
intersection dimensions of *graphs*; -.

Degree: Mathematical Science, 2010, INFLIBNET

URL: http://shodhganga.inflibnet.ac.in/handle/10603/4726

►

This thesis deals mainly with two related coloring problems ? forbidden subgraph colorings and oriented colorings. The former deals with proper colorings of vertices or… (more)

Subjects/Keywords: Graphs; Graphs dimensions; Graphs colorings

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Arvind, N. R. (2010). Forbidden subgraph colorings, oriented colorings and intersection dimensions of graphs; -. (Thesis). INFLIBNET. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/4726

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

Arvind, N R. “Forbidden subgraph colorings, oriented colorings and intersection dimensions of graphs; -.” 2010. Thesis, INFLIBNET. Accessed February 27, 2020. http://shodhganga.inflibnet.ac.in/handle/10603/4726.

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Arvind, N R. “Forbidden subgraph colorings, oriented colorings and intersection dimensions of graphs; -.” 2010. Web. 27 Feb 2020.

Vancouver:

Arvind NR. Forbidden subgraph colorings, oriented colorings and intersection dimensions of graphs; -. [Internet] [Thesis]. INFLIBNET; 2010. [cited 2020 Feb 27]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/4726.

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

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Arvind NR. Forbidden subgraph colorings, oriented colorings and intersection dimensions of graphs; -. [Thesis]. INFLIBNET; 2010. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/4726

Not specified: Masters Thesis or Doctoral Dissertation

University of Western Australia

2.
Amarra, Maria Carmen.
Symmetric *graphs* of diameter two.

Degree: PhD, 2012, University of Western Australia

URL: http://repository.uwa.edu.au:80/R/?func=dbin-jump-full&object_id=33953&local_base=GEN01-INS01

►

A graph Γ is G-symmetric if it admits an arc-transitive subgroup G of automorphisms, and has diameter 2 if it is not a complete graph… (more)

Subjects/Keywords: Systematic graphs; Diameter two graphs

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Amarra, M. C. (2012). Symmetric graphs of diameter two. (Doctoral Dissertation). University of Western Australia. Retrieved from http://repository.uwa.edu.au:80/R/?func=dbin-jump-full&object_id=33953&local_base=GEN01-INS01

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

Amarra, Maria Carmen. “Symmetric graphs of diameter two.” 2012. Doctoral Dissertation, University of Western Australia. Accessed February 27, 2020. http://repository.uwa.edu.au:80/R/?func=dbin-jump-full&object_id=33953&local_base=GEN01-INS01.

MLA Handbook (7^{th} Edition):

Amarra, Maria Carmen. “Symmetric graphs of diameter two.” 2012. Web. 27 Feb 2020.

Vancouver:

Amarra MC. Symmetric graphs of diameter two. [Internet] [Doctoral dissertation]. University of Western Australia; 2012. [cited 2020 Feb 27]. Available from: http://repository.uwa.edu.au:80/R/?func=dbin-jump-full&object_id=33953&local_base=GEN01-INS01.

Council of Science Editors:

Amarra MC. Symmetric graphs of diameter two. [Doctoral Dissertation]. University of Western Australia; 2012. Available from: http://repository.uwa.edu.au:80/R/?func=dbin-jump-full&object_id=33953&local_base=GEN01-INS01

University of Georgia

3. Che, Dongsheng. Computational methods for deciphering genomic structures in prokaryotes.

Degree: PhD, Computer Science, 2008, University of Georgia

URL: http://purl.galileo.usg.edu/uga_etd/che_dongsheng_200808_phd

► High-throughput sequencing technologies have generated huge amounts of genomic data. This wealth of genomic data provides computational biologists unprecedented opportunities to unveil the biological machinery…
(more)

Subjects/Keywords: Bipartite graphs

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Che, D. (2008). Computational methods for deciphering genomic structures in prokaryotes. (Doctoral Dissertation). University of Georgia. Retrieved from http://purl.galileo.usg.edu/uga_etd/che_dongsheng_200808_phd

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

Che, Dongsheng. “Computational methods for deciphering genomic structures in prokaryotes.” 2008. Doctoral Dissertation, University of Georgia. Accessed February 27, 2020. http://purl.galileo.usg.edu/uga_etd/che_dongsheng_200808_phd.

MLA Handbook (7^{th} Edition):

Che, Dongsheng. “Computational methods for deciphering genomic structures in prokaryotes.” 2008. Web. 27 Feb 2020.

Vancouver:

Che D. Computational methods for deciphering genomic structures in prokaryotes. [Internet] [Doctoral dissertation]. University of Georgia; 2008. [cited 2020 Feb 27]. Available from: http://purl.galileo.usg.edu/uga_etd/che_dongsheng_200808_phd.

Council of Science Editors:

Che D. Computational methods for deciphering genomic structures in prokaryotes. [Doctoral Dissertation]. University of Georgia; 2008. Available from: http://purl.galileo.usg.edu/uga_etd/che_dongsheng_200808_phd

University of Georgia

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

Degree: MS, Computer Science, 2010, University of Georgia

URL: http://purl.galileo.usg.edu/uga_etd/rath_bijaya_201012_ms

► 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

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Rath, B. (2010). Generation of non-isomorphic cubic Cayley graphs. (Masters Thesis). University of Georgia. Retrieved from http://purl.galileo.usg.edu/uga_etd/rath_bijaya_201012_ms

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

Rath, Bijaya. “Generation of non-isomorphic cubic Cayley graphs.” 2010. Masters Thesis, University of Georgia. Accessed February 27, 2020. http://purl.galileo.usg.edu/uga_etd/rath_bijaya_201012_ms.

MLA Handbook (7^{th} Edition):

Rath, Bijaya. “Generation of non-isomorphic cubic Cayley graphs.” 2010. Web. 27 Feb 2020.

Vancouver:

Rath B. Generation of non-isomorphic cubic Cayley graphs. [Internet] [Masters thesis]. University of Georgia; 2010. [cited 2020 Feb 27]. Available from: http://purl.galileo.usg.edu/uga_etd/rath_bijaya_201012_ms.

Council of Science Editors:

Rath B. Generation of non-isomorphic cubic Cayley graphs. [Masters Thesis]. University of Georgia; 2010. Available from: http://purl.galileo.usg.edu/uga_etd/rath_bijaya_201012_ms

University of Georgia

5.
Cinkir, Zubeyir.
The tau constant of metrized * graphs*.

Degree: PhD, Mathematics, 2007, University of Georgia

URL: http://purl.galileo.usg.edu/uga_etd/cinkir_zubeyir_200708_phd

► Metrized *graphs*, which are in 1−1 correspondence with weighted *graphs*, were introduced by R. Rumely in order to study arithmetic properties of curves. “Reduction graphs”,…
(more)

Subjects/Keywords: Metrized graphs

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Cinkir, Z. (2007). The tau constant of metrized graphs. (Doctoral Dissertation). University of Georgia. Retrieved from http://purl.galileo.usg.edu/uga_etd/cinkir_zubeyir_200708_phd

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

Cinkir, Zubeyir. “The tau constant of metrized graphs.” 2007. Doctoral Dissertation, University of Georgia. Accessed February 27, 2020. http://purl.galileo.usg.edu/uga_etd/cinkir_zubeyir_200708_phd.

MLA Handbook (7^{th} Edition):

Cinkir, Zubeyir. “The tau constant of metrized graphs.” 2007. Web. 27 Feb 2020.

Vancouver:

Cinkir Z. The tau constant of metrized graphs. [Internet] [Doctoral dissertation]. University of Georgia; 2007. [cited 2020 Feb 27]. Available from: http://purl.galileo.usg.edu/uga_etd/cinkir_zubeyir_200708_phd.

Council of Science Editors:

Cinkir Z. The tau constant of metrized graphs. [Doctoral Dissertation]. University of Georgia; 2007. Available from: http://purl.galileo.usg.edu/uga_etd/cinkir_zubeyir_200708_phd

6.
Mozes, Shay.
Efficient Algorithms for Shortest-Path and Maximum-Flow
Problems in Planar * Graphs*.

Degree: PhD, Computer Science, 2013, Brown University

URL: https://repository.library.brown.edu/studio/item/bdr:320482/

► Large *graphs* are ubiquitous in many diverse fields ranging from sociology and economics to biology and engineering. Applications in numerous areas such as transportation, geographical…
(more)

Subjects/Keywords: planar graphs

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Mozes, S. (2013). Efficient Algorithms for Shortest-Path and Maximum-Flow Problems in Planar Graphs. (Doctoral Dissertation). Brown University. Retrieved from https://repository.library.brown.edu/studio/item/bdr:320482/

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

Mozes, Shay. “Efficient Algorithms for Shortest-Path and Maximum-Flow Problems in Planar Graphs.” 2013. Doctoral Dissertation, Brown University. Accessed February 27, 2020. https://repository.library.brown.edu/studio/item/bdr:320482/.

MLA Handbook (7^{th} Edition):

Mozes, Shay. “Efficient Algorithms for Shortest-Path and Maximum-Flow Problems in Planar Graphs.” 2013. Web. 27 Feb 2020.

Vancouver:

Mozes S. Efficient Algorithms for Shortest-Path and Maximum-Flow Problems in Planar Graphs. [Internet] [Doctoral dissertation]. Brown University; 2013. [cited 2020 Feb 27]. Available from: https://repository.library.brown.edu/studio/item/bdr:320482/.

Council of Science Editors:

Mozes S. Efficient Algorithms for Shortest-Path and Maximum-Flow Problems in Planar Graphs. [Doctoral Dissertation]. Brown University; 2013. Available from: https://repository.library.brown.edu/studio/item/bdr:320482/

Rutgers University

7.
Baron, Jacob D., 1988-.
Two problems on cycles in random * graphs*.

Degree: PhD, Mathematics, 2016, Rutgers University

URL: https://rucore.libraries.rutgers.edu/rutgers-lib/51229/

►

We prove three results. First, an old conjecture of Zs. Tuza says that for any graph G, the ratio of the minimum size, τ3(G), of… (more)

Subjects/Keywords: Random graphs

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Baron, Jacob D., 1. (2016). Two problems on cycles in random graphs. (Doctoral Dissertation). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/51229/

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

Baron, Jacob D., 1988-. “Two problems on cycles in random graphs.” 2016. Doctoral Dissertation, Rutgers University. Accessed February 27, 2020. https://rucore.libraries.rutgers.edu/rutgers-lib/51229/.

MLA Handbook (7^{th} Edition):

Baron, Jacob D., 1988-. “Two problems on cycles in random graphs.” 2016. Web. 27 Feb 2020.

Vancouver:

Baron, Jacob D. 1. Two problems on cycles in random graphs. [Internet] [Doctoral dissertation]. Rutgers University; 2016. [cited 2020 Feb 27]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/51229/.

Council of Science Editors:

Baron, Jacob D. 1. Two problems on cycles in random graphs. [Doctoral Dissertation]. Rutgers University; 2016. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/51229/

8.
Camarero Coterillo, Cristobal.
Distance and symmetry properties of *graphs* and their application to interconnection networks and codes: Propiedades de distancia y simetría en grafos y su aplicación a redes de interconexión y códigos.

Degree: 2015, Universidad de Cantabria

URL: http://hdl.handle.net/10902/6542

► ABSTRACT: The topology of a interconnection network is the graph of its routers. The topologies that are being currently used in large supercomputers can be…
(more)

Subjects/Keywords: Graphs

…brings the
definition of lattice *graphs*, which actually contains all Cayley *graphs* over Abelian… …used
in crystallography. When these are used to define lattice *graphs*, good properties are… …machines. From the properties of these crystal lattice *graphs* the symmetry is
very notable; it is… …obtained that symmetric lattice *graphs* have better performance than
the asymmetric ones. This… …implement them in
racks. Although there are known families of *graphs* with better distance…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Camarero Coterillo, C. (2015). Distance and symmetry properties of graphs and their application to interconnection networks and codes: Propiedades de distancia y simetría en grafos y su aplicación a redes de interconexión y códigos. (Doctoral Dissertation). Universidad de Cantabria. Retrieved from http://hdl.handle.net/10902/6542

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

Camarero Coterillo, Cristobal. “Distance and symmetry properties of graphs and their application to interconnection networks and codes: Propiedades de distancia y simetría en grafos y su aplicación a redes de interconexión y códigos.” 2015. Doctoral Dissertation, Universidad de Cantabria. Accessed February 27, 2020. http://hdl.handle.net/10902/6542.

MLA Handbook (7^{th} Edition):

Camarero Coterillo, Cristobal. “Distance and symmetry properties of graphs and their application to interconnection networks and codes: Propiedades de distancia y simetría en grafos y su aplicación a redes de interconexión y códigos.” 2015. Web. 27 Feb 2020.

Vancouver:

Camarero Coterillo C. Distance and symmetry properties of graphs and their application to interconnection networks and codes: Propiedades de distancia y simetría en grafos y su aplicación a redes de interconexión y códigos. [Internet] [Doctoral dissertation]. Universidad de Cantabria; 2015. [cited 2020 Feb 27]. Available from: http://hdl.handle.net/10902/6542.

Council of Science Editors:

Camarero Coterillo C. Distance and symmetry properties of graphs and their application to interconnection networks and codes: Propiedades de distancia y simetría en grafos y su aplicación a redes de interconexión y códigos. [Doctoral Dissertation]. Universidad de Cantabria; 2015. Available from: http://hdl.handle.net/10902/6542

Indian Institute of Science

9.
Francis, Mathew C.
Intersection *Graphs* Of Boxes And Cubes.

Degree: 2009, Indian Institute of Science

URL: http://hdl.handle.net/2005/1027

► A graph Gis said to be an intersection graph of sets from a family of sets if there exists a function ƒ : V(G)→ such…
(more)

Subjects/Keywords: Computer Graphics; Boxicity (Graphs); Cubicity (Graphs); Interval Graphs; Halin Graphs; Planar Graphs; Intersection Graphs; Random Graphs; Computer Science

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Francis, M. C. (2009). Intersection Graphs Of Boxes And Cubes. (Thesis). Indian Institute of Science. Retrieved from http://hdl.handle.net/2005/1027

Not specified: Masters Thesis or Doctoral Dissertation

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

Francis, Mathew C. “Intersection Graphs Of Boxes And Cubes.” 2009. Thesis, Indian Institute of Science. Accessed February 27, 2020. http://hdl.handle.net/2005/1027.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Francis, Mathew C. “Intersection Graphs Of Boxes And Cubes.” 2009. Web. 27 Feb 2020.

Vancouver:

Francis MC. Intersection Graphs Of Boxes And Cubes. [Internet] [Thesis]. Indian Institute of Science; 2009. [cited 2020 Feb 27]. Available from: http://hdl.handle.net/2005/1027.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Francis MC. Intersection Graphs Of Boxes And Cubes. [Thesis]. Indian Institute of Science; 2009. Available from: http://hdl.handle.net/2005/1027

Not specified: Masters Thesis or Doctoral Dissertation

Jawaharlal Nehru University

10.
Krishna Reddy, Polepalli.
Synchronization based on data flow *graphs* for distributed
and replicated databases; -.

Degree: Computer Science, 1993, Jawaharlal Nehru University

URL: http://shodhganga.inflibnet.ac.in/handle/10603/16640

►

In this study, we present concurrency control algorithms based on data flow *graphs* for newlinedistributed and replicated databases. newlineGraphical representations such as token models and…
(more)

Subjects/Keywords: Computer Science; graphs; Replicated; databses; flow graphs

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Krishna Reddy, P. (1993). Synchronization based on data flow graphs for distributed and replicated databases; -. (Thesis). Jawaharlal Nehru University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/16640

Not specified: Masters Thesis or Doctoral Dissertation

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

Krishna Reddy, Polepalli. “Synchronization based on data flow graphs for distributed and replicated databases; -.” 1993. Thesis, Jawaharlal Nehru University. Accessed February 27, 2020. http://shodhganga.inflibnet.ac.in/handle/10603/16640.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Krishna Reddy, Polepalli. “Synchronization based on data flow graphs for distributed and replicated databases; -.” 1993. Web. 27 Feb 2020.

Vancouver:

Krishna Reddy P. Synchronization based on data flow graphs for distributed and replicated databases; -. [Internet] [Thesis]. Jawaharlal Nehru University; 1993. [cited 2020 Feb 27]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/16640.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Krishna Reddy P. Synchronization based on data flow graphs for distributed and replicated databases; -. [Thesis]. Jawaharlal Nehru University; 1993. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/16640

Not specified: Masters Thesis or Doctoral Dissertation

Louisiana State University

11.
Iverson, Perry K.
Refining the characterization of projective * graphs*.

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

URL: etd-07072013-161459 ; https://digitalcommons.lsu.edu/gradschool_dissertations/3914

► Archdeacon showed that the class of *graphs* embeddable in the projective plane is characterized by a set of 35 excluded minors. Robertson, Seymour and Thomas…
(more)

Subjects/Keywords: minors; excluded minors; projective graphs; graphs

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Iverson, P. K. (2013). Refining the characterization of projective graphs. (Doctoral Dissertation). Louisiana State University. Retrieved from etd-07072013-161459 ; https://digitalcommons.lsu.edu/gradschool_dissertations/3914

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

Iverson, Perry K. “Refining the characterization of projective graphs.” 2013. Doctoral Dissertation, Louisiana State University. Accessed February 27, 2020. etd-07072013-161459 ; https://digitalcommons.lsu.edu/gradschool_dissertations/3914.

MLA Handbook (7^{th} Edition):

Iverson, Perry K. “Refining the characterization of projective graphs.” 2013. Web. 27 Feb 2020.

Vancouver:

Iverson PK. Refining the characterization of projective graphs. [Internet] [Doctoral dissertation]. Louisiana State University; 2013. [cited 2020 Feb 27]. Available from: etd-07072013-161459 ; https://digitalcommons.lsu.edu/gradschool_dissertations/3914.

Council of Science Editors:

Iverson PK. Refining the characterization of projective graphs. [Doctoral Dissertation]. Louisiana State University; 2013. Available from: etd-07072013-161459 ; https://digitalcommons.lsu.edu/gradschool_dissertations/3914

Louisiana State University

12.
Dziobiak, Stanislaw.
Excluded-minor characterization of apex-outerplanar * graphs*.

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

URL: etd-07062011-183918 ; https://digitalcommons.lsu.edu/gradschool_dissertations/3102

► It is well known that the class of outerplanar *graphs* is minor-closed and can be characterized by two excluded minors: K_{4} and K_{2,3}. The class…
(more)

Subjects/Keywords: outerplanar graphs; excluded minors; minors; graphs

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Dziobiak, S. (2011). Excluded-minor characterization of apex-outerplanar graphs. (Doctoral Dissertation). Louisiana State University. Retrieved from etd-07062011-183918 ; https://digitalcommons.lsu.edu/gradschool_dissertations/3102

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

Dziobiak, Stanislaw. “Excluded-minor characterization of apex-outerplanar graphs.” 2011. Doctoral Dissertation, Louisiana State University. Accessed February 27, 2020. etd-07062011-183918 ; https://digitalcommons.lsu.edu/gradschool_dissertations/3102.

MLA Handbook (7^{th} Edition):

Dziobiak, Stanislaw. “Excluded-minor characterization of apex-outerplanar graphs.” 2011. Web. 27 Feb 2020.

Vancouver:

Dziobiak S. Excluded-minor characterization of apex-outerplanar graphs. [Internet] [Doctoral dissertation]. Louisiana State University; 2011. [cited 2020 Feb 27]. Available from: etd-07062011-183918 ; https://digitalcommons.lsu.edu/gradschool_dissertations/3102.

Council of Science Editors:

Dziobiak S. Excluded-minor characterization of apex-outerplanar graphs. [Doctoral Dissertation]. Louisiana State University; 2011. Available from: etd-07062011-183918 ; https://digitalcommons.lsu.edu/gradschool_dissertations/3102

University of Newcastle

13. Feria Puron, Ramiro. Large interconnection networks with given degree and diameter.

Degree: PhD, 2015, University of Newcastle

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

►

Research Doctorate - Doctor of Philosophy (PhD)

This thesis investigates and provides several answers for one of the most representative open problems in the design… (more)

Subjects/Keywords: degree diameter problem; graphs; moore bound; bipartite graphs; circulant graphs; graphs on surfaces

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Feria Puron, R. (2015). Large interconnection networks with given degree and diameter. (Doctoral Dissertation). University of Newcastle. Retrieved from http://hdl.handle.net/1959.13/1295870

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

Feria Puron, Ramiro. “Large interconnection networks with given degree and diameter.” 2015. Doctoral Dissertation, University of Newcastle. Accessed February 27, 2020. http://hdl.handle.net/1959.13/1295870.

MLA Handbook (7^{th} Edition):

Feria Puron, Ramiro. “Large interconnection networks with given degree and diameter.” 2015. Web. 27 Feb 2020.

Vancouver:

Feria Puron R. Large interconnection networks with given degree and diameter. [Internet] [Doctoral dissertation]. University of Newcastle; 2015. [cited 2020 Feb 27]. Available from: http://hdl.handle.net/1959.13/1295870.

Council of Science Editors:

Feria Puron R. Large interconnection networks with given degree and diameter. [Doctoral Dissertation]. University of Newcastle; 2015. Available from: http://hdl.handle.net/1959.13/1295870

The Ohio State University

14.
Poole, Daniel James.
A Study of Random Hypergraphs and Directed * Graphs*.

Degree: PhD, Mathematics, 2014, The Ohio State University

URL: http://rave.ohiolink.edu/etdc/view?acc_num=osu1397222674

► We establish and describe the likely structure of random hypergraph and directed graph models, expanding upon classical results that pertain to the likely structure of…
(more)

Subjects/Keywords: Mathematics; Random Graphs

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Poole, D. J. (2014). A Study of Random Hypergraphs and Directed Graphs. (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1397222674

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

Poole, Daniel James. “A Study of Random Hypergraphs and Directed Graphs.” 2014. Doctoral Dissertation, The Ohio State University. Accessed February 27, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=osu1397222674.

MLA Handbook (7^{th} Edition):

Poole, Daniel James. “A Study of Random Hypergraphs and Directed Graphs.” 2014. Web. 27 Feb 2020.

Vancouver:

Poole DJ. A Study of Random Hypergraphs and Directed Graphs. [Internet] [Doctoral dissertation]. The Ohio State University; 2014. [cited 2020 Feb 27]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1397222674.

Council of Science Editors:

Poole DJ. A Study of Random Hypergraphs and Directed Graphs. [Doctoral Dissertation]. The Ohio State University; 2014. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1397222674

University of Victoria

15. Hassanlou, Nasrin. Probabilistic graph summarization.

Degree: Dept. of Computer Science, 2013, University of Victoria

URL: http://hdl.handle.net/1828/4403

► We study group-summarization of probabilistic *graphs* that naturally arise in social networks, semistructured data, and other applications. Our proposed framework groups the nodes and edges…
(more)

Subjects/Keywords: graphs; users; algorithms

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Hassanlou, N. (2013). Probabilistic graph summarization. (Masters Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/4403

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

Hassanlou, Nasrin. “Probabilistic graph summarization.” 2013. Masters Thesis, University of Victoria. Accessed February 27, 2020. http://hdl.handle.net/1828/4403.

MLA Handbook (7^{th} Edition):

Hassanlou, Nasrin. “Probabilistic graph summarization.” 2013. Web. 27 Feb 2020.

Vancouver:

Hassanlou N. Probabilistic graph summarization. [Internet] [Masters thesis]. University of Victoria; 2013. [cited 2020 Feb 27]. Available from: http://hdl.handle.net/1828/4403.

Council of Science Editors:

Hassanlou N. Probabilistic graph summarization. [Masters Thesis]. University of Victoria; 2013. Available from: http://hdl.handle.net/1828/4403

University of the Western Cape

16.
Fadhal, Emad Alden Sir Alkhatim Abraham.
Strong simplicity of groups and vertex - transitive * graphs*
.

Degree: 2010, University of the Western Cape

URL: http://hdl.handle.net/11394/1430

► In the course of exploring various symmetries of vertex-transitive *graphs*, we introduce the concept of quasi-normal subgroups in groups. This is done since the symmetries…
(more)

Subjects/Keywords: vertex-transitive graphs

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Fadhal, E. A. S. A. A. (2010). Strong simplicity of groups and vertex - transitive graphs . (Thesis). University of the Western Cape. Retrieved from http://hdl.handle.net/11394/1430

Not specified: Masters Thesis or Doctoral Dissertation

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

Fadhal, Emad Alden Sir Alkhatim Abraham. “Strong simplicity of groups and vertex - transitive graphs .” 2010. Thesis, University of the Western Cape. Accessed February 27, 2020. http://hdl.handle.net/11394/1430.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Fadhal, Emad Alden Sir Alkhatim Abraham. “Strong simplicity of groups and vertex - transitive graphs .” 2010. Web. 27 Feb 2020.

Vancouver:

Fadhal EASAA. Strong simplicity of groups and vertex - transitive graphs . [Internet] [Thesis]. University of the Western Cape; 2010. [cited 2020 Feb 27]. Available from: http://hdl.handle.net/11394/1430.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Fadhal EASAA. Strong simplicity of groups and vertex - transitive graphs . [Thesis]. University of the Western Cape; 2010. Available from: http://hdl.handle.net/11394/1430

Not specified: Masters Thesis or Doctoral Dissertation

17.
El Harabi, Rafika.
Supervision des processus chimiques à base de modèles Bond *Graphs* : Bond Graph Model Based for Supervision of Chemical Processes.

Degree: Docteur es, Automatique, Génie informatique, Traitement du Signal et Images, 2011, Université Lille I – Sciences et Technologies

URL: http://www.theses.fr/2011LIL10074

►

Le travail de thèse proposé concerne la conception intégrée des algorithmes de surveillance des processus chimiques à base de modèles bond graph. Cette recherche est… (more)

Subjects/Keywords: Bond Graphs; 629.895

Record Details Similar Records

❌

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

APA (6^{th} Edition):

El Harabi, R. (2011). Supervision des processus chimiques à base de modèles Bond Graphs : Bond Graph Model Based for Supervision of Chemical Processes. (Doctoral Dissertation). Université Lille I – Sciences et Technologies. Retrieved from http://www.theses.fr/2011LIL10074

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

El Harabi, Rafika. “Supervision des processus chimiques à base de modèles Bond Graphs : Bond Graph Model Based for Supervision of Chemical Processes.” 2011. Doctoral Dissertation, Université Lille I – Sciences et Technologies. Accessed February 27, 2020. http://www.theses.fr/2011LIL10074.

MLA Handbook (7^{th} Edition):

El Harabi, Rafika. “Supervision des processus chimiques à base de modèles Bond Graphs : Bond Graph Model Based for Supervision of Chemical Processes.” 2011. Web. 27 Feb 2020.

Vancouver:

El Harabi R. Supervision des processus chimiques à base de modèles Bond Graphs : Bond Graph Model Based for Supervision of Chemical Processes. [Internet] [Doctoral dissertation]. Université Lille I – Sciences et Technologies; 2011. [cited 2020 Feb 27]. Available from: http://www.theses.fr/2011LIL10074.

Council of Science Editors:

El Harabi R. Supervision des processus chimiques à base de modèles Bond Graphs : Bond Graph Model Based for Supervision of Chemical Processes. [Doctoral Dissertation]. Université Lille I – Sciences et Technologies; 2011. Available from: http://www.theses.fr/2011LIL10074

University of Waterloo

18.
Lato, Sabrina.
Quantum Walks on Oriented * Graphs*.

Degree: 2019, University of Waterloo

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

► This thesis extends results about periodicity and perfect state transfer to oriented *graphs*. We prove that if a vertex a is periodic, then elements of…
(more)

Subjects/Keywords: quantum walks; graphs

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Lato, S. (2019). Quantum Walks on Oriented Graphs. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/14338

Not specified: Masters Thesis or Doctoral Dissertation

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

Lato, Sabrina. “Quantum Walks on Oriented Graphs.” 2019. Thesis, University of Waterloo. Accessed February 27, 2020. http://hdl.handle.net/10012/14338.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Lato, Sabrina. “Quantum Walks on Oriented Graphs.” 2019. Web. 27 Feb 2020.

Vancouver:

Lato S. Quantum Walks on Oriented Graphs. [Internet] [Thesis]. University of Waterloo; 2019. [cited 2020 Feb 27]. Available from: http://hdl.handle.net/10012/14338.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Lato S. Quantum Walks on Oriented Graphs. [Thesis]. University of Waterloo; 2019. Available from: http://hdl.handle.net/10012/14338

Not specified: Masters Thesis or Doctoral Dissertation

Victoria University of Wellington

19. Snook, Michael. Matroids, Complexity and Computation.

Degree: 2013, Victoria University of Wellington

URL: http://hdl.handle.net/10063/2885

► The node deletion problem on *graphs* is: given a graph and integer k, can we delete no more than k vertices to obtain a graph…
(more)

Subjects/Keywords: Graphs; Computation; Complexity

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Snook, M. (2013). Matroids, Complexity and Computation. (Doctoral Dissertation). Victoria University of Wellington. Retrieved from http://hdl.handle.net/10063/2885

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

Snook, Michael. “Matroids, Complexity and Computation.” 2013. Doctoral Dissertation, Victoria University of Wellington. Accessed February 27, 2020. http://hdl.handle.net/10063/2885.

MLA Handbook (7^{th} Edition):

Snook, Michael. “Matroids, Complexity and Computation.” 2013. Web. 27 Feb 2020.

Vancouver:

Snook M. Matroids, Complexity and Computation. [Internet] [Doctoral dissertation]. Victoria University of Wellington; 2013. [cited 2020 Feb 27]. Available from: http://hdl.handle.net/10063/2885.

Council of Science Editors:

Snook M. Matroids, Complexity and Computation. [Doctoral Dissertation]. Victoria University of Wellington; 2013. Available from: http://hdl.handle.net/10063/2885

University of Victoria

20.
Neilson, Linda.
Broadcast independence in * graphs*.

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

URL: http://hdl.handle.net/1828/11084

► The usual graph parameters related to independent and dominating sets can be adapted to broadcasts on *graphs*. We examine some possible definitions for an inde-…
(more)

Subjects/Keywords: Broadcasts; Graphs; Independence

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Neilson, L. (2019). Broadcast independence in graphs. (Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/11084

Not specified: Masters Thesis or Doctoral Dissertation

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

Neilson, Linda. “Broadcast independence in graphs.” 2019. Thesis, University of Victoria. Accessed February 27, 2020. http://hdl.handle.net/1828/11084.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Neilson, Linda. “Broadcast independence in graphs.” 2019. Web. 27 Feb 2020.

Vancouver:

Neilson L. Broadcast independence in graphs. [Internet] [Thesis]. University of Victoria; 2019. [cited 2020 Feb 27]. Available from: http://hdl.handle.net/1828/11084.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Neilson L. Broadcast independence in graphs. [Thesis]. University of Victoria; 2019. Available from: http://hdl.handle.net/1828/11084

Not specified: Masters Thesis or Doctoral Dissertation

University of Kansas

21.
Adams, Kevin Daniel.
On Kernels, β-*graphs*, and β-graph Sequences of Digraphs.

Degree: MA, Mathematics, 2015, University of Kansas

URL: http://hdl.handle.net/1808/19005

► We begin by investigating some conditions determining the existence of kernels in various classes of directed *graphs*, most notably in oriented trees, grid *graphs*, and…
(more)

Subjects/Keywords: Mathematics; Absorbant Sets; Directed Graphs; Dominating Sets; β-graphs; 𝛾-graphs

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Adams, K. D. (2015). On Kernels, β-graphs, and β-graph Sequences of Digraphs. (Masters Thesis). University of Kansas. Retrieved from http://hdl.handle.net/1808/19005

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

Adams, Kevin Daniel. “On Kernels, β-graphs, and β-graph Sequences of Digraphs.” 2015. Masters Thesis, University of Kansas. Accessed February 27, 2020. http://hdl.handle.net/1808/19005.

MLA Handbook (7^{th} Edition):

Adams, Kevin Daniel. “On Kernels, β-graphs, and β-graph Sequences of Digraphs.” 2015. Web. 27 Feb 2020.

Vancouver:

Adams KD. On Kernels, β-graphs, and β-graph Sequences of Digraphs. [Internet] [Masters thesis]. University of Kansas; 2015. [cited 2020 Feb 27]. Available from: http://hdl.handle.net/1808/19005.

Council of Science Editors:

Adams KD. On Kernels, β-graphs, and β-graph Sequences of Digraphs. [Masters Thesis]. University of Kansas; 2015. Available from: http://hdl.handle.net/1808/19005

Western Michigan University

22.
Byers, Alexis D.
Graceful Colorings and Connection in * Graphs*.

Degree: PhD, Mathematics, 2018, Western Michigan University

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

► For a graph G of size m, a graceful labeling of G is an injective function f : V (G) → {0, 1, .…
(more)

Subjects/Keywords: Graphs; coloring in graphs; connections in graphs; mathematics; Mathematics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Byers, A. D. (2018). Graceful Colorings and Connection in Graphs. (Doctoral Dissertation). Western Michigan University. Retrieved from https://scholarworks.wmich.edu/dissertations/3308

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

Byers, Alexis D. “Graceful Colorings and Connection in Graphs.” 2018. Doctoral Dissertation, Western Michigan University. Accessed February 27, 2020. https://scholarworks.wmich.edu/dissertations/3308.

MLA Handbook (7^{th} Edition):

Byers, Alexis D. “Graceful Colorings and Connection in Graphs.” 2018. Web. 27 Feb 2020.

Vancouver:

Byers AD. Graceful Colorings and Connection in Graphs. [Internet] [Doctoral dissertation]. Western Michigan University; 2018. [cited 2020 Feb 27]. Available from: https://scholarworks.wmich.edu/dissertations/3308.

Council of Science Editors:

Byers AD. Graceful Colorings and Connection in Graphs. [Doctoral Dissertation]. Western Michigan University; 2018. Available from: https://scholarworks.wmich.edu/dissertations/3308

23.
Skrepetos, Dimitrios.
Shortest Paths in Geometric Intersection * Graphs*.

Degree: 2018, University of Waterloo

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

► This thesis studies shortest paths in geometric intersection *graphs*, which can model, among others, ad-hoc communication and transportation networks. First, we consider two classical problems…
(more)

Subjects/Keywords: shortest paths; unit-disk graphs; planar graphs; geometric intersection graphs; diameter

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Skrepetos, D. (2018). Shortest Paths in Geometric Intersection Graphs. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/13454

Not specified: Masters Thesis or Doctoral Dissertation

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

Skrepetos, Dimitrios. “Shortest Paths in Geometric Intersection Graphs.” 2018. Thesis, University of Waterloo. Accessed February 27, 2020. http://hdl.handle.net/10012/13454.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Skrepetos, Dimitrios. “Shortest Paths in Geometric Intersection Graphs.” 2018. Web. 27 Feb 2020.

Vancouver:

Skrepetos D. Shortest Paths in Geometric Intersection Graphs. [Internet] [Thesis]. University of Waterloo; 2018. [cited 2020 Feb 27]. Available from: http://hdl.handle.net/10012/13454.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Skrepetos D. Shortest Paths in Geometric Intersection Graphs. [Thesis]. University of Waterloo; 2018. Available from: http://hdl.handle.net/10012/13454

Not specified: Masters Thesis or Doctoral Dissertation

Indian Institute of Science

24.
Mathew, Rogers.
Boxicity And Cubicity : A Study On Special Classes Of * Graphs*.

Degree: 2012, Indian Institute of Science

URL: http://hdl.handle.net/2005/2320

► Let F be a family of sets. A graph G is an intersection graph of sets from the family F if there exists a mapping…
(more)

Subjects/Keywords: Graphs; Boxicity; Leaf Powers; Random Grpahs; Line Graphs; Chordal Bipartite Graphs; Random Graphs; k-chordal Graphs; Crossing Number; Cubicity; Geometry

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Mathew, R. (2012). Boxicity And Cubicity : A Study On Special Classes Of Graphs. (Thesis). Indian Institute of Science. Retrieved from http://hdl.handle.net/2005/2320

Not specified: Masters Thesis or Doctoral Dissertation

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

Mathew, Rogers. “Boxicity And Cubicity : A Study On Special Classes Of Graphs.” 2012. Thesis, Indian Institute of Science. Accessed February 27, 2020. http://hdl.handle.net/2005/2320.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Mathew, Rogers. “Boxicity And Cubicity : A Study On Special Classes Of Graphs.” 2012. Web. 27 Feb 2020.

Vancouver:

Mathew R. Boxicity And Cubicity : A Study On Special Classes Of Graphs. [Internet] [Thesis]. Indian Institute of Science; 2012. [cited 2020 Feb 27]. Available from: http://hdl.handle.net/2005/2320.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Mathew R. Boxicity And Cubicity : A Study On Special Classes Of Graphs. [Thesis]. Indian Institute of Science; 2012. Available from: http://hdl.handle.net/2005/2320

Not specified: Masters Thesis or Doctoral Dissertation

Indian Institute of Science

25.
Mathew, Rogers.
Boxicity And Cubicity : A Study On Special Classes Of * Graphs*.

Degree: 2012, Indian Institute of Science

URL: http://etd.iisc.ernet.in/handle/2005/2320 ; http://etd.ncsi.iisc.ernet.in/abstracts/2983/G25263-Abs.pdf

► Let F be a family of sets. A graph G is an intersection graph of sets from the family F if there exists a mapping…
(more)

Subjects/Keywords: Graphs; Boxicity; Leaf Powers; Random Grpahs; Line Graphs; Chordal Bipartite Graphs; Random Graphs; k-chordal Graphs; Crossing Number; Cubicity; Geometry

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Mathew, R. (2012). Boxicity And Cubicity : A Study On Special Classes Of Graphs. (Thesis). Indian Institute of Science. Retrieved from http://etd.iisc.ernet.in/handle/2005/2320 ; http://etd.ncsi.iisc.ernet.in/abstracts/2983/G25263-Abs.pdf

Not specified: Masters Thesis or Doctoral Dissertation

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

Mathew, Rogers. “Boxicity And Cubicity : A Study On Special Classes Of Graphs.” 2012. Thesis, Indian Institute of Science. Accessed February 27, 2020. http://etd.iisc.ernet.in/handle/2005/2320 ; http://etd.ncsi.iisc.ernet.in/abstracts/2983/G25263-Abs.pdf.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Mathew, Rogers. “Boxicity And Cubicity : A Study On Special Classes Of Graphs.” 2012. Web. 27 Feb 2020.

Vancouver:

Mathew R. Boxicity And Cubicity : A Study On Special Classes Of Graphs. [Internet] [Thesis]. Indian Institute of Science; 2012. [cited 2020 Feb 27]. Available from: http://etd.iisc.ernet.in/handle/2005/2320 ; http://etd.ncsi.iisc.ernet.in/abstracts/2983/G25263-Abs.pdf.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Mathew R. Boxicity And Cubicity : A Study On Special Classes Of Graphs. [Thesis]. Indian Institute of Science; 2012. Available from: http://etd.iisc.ernet.in/handle/2005/2320 ; http://etd.ncsi.iisc.ernet.in/abstracts/2983/G25263-Abs.pdf

Not specified: Masters Thesis or Doctoral Dissertation

University of Tennessee – Knoxville

26. McClurkin, Grace Elizabeth. Generalizations and Variations of the Zero-Divisor Graph.

Degree: 2017, University of Tennessee – Knoxville

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

► We explore generalizations and variations of the zero-divisor graph on commutative rings with identity. A zero-divisor graph is a graph whose vertex set is the…
(more)

Subjects/Keywords: Commutative Ring Theory; Zero-Divisor Graphs; Congruence-Based Zero-Divisor Graphs; Annihilator Graphs; Extended Zero-Divisor Graphs; Compressed Graphs; Algebra

Record Details Similar Records

❌

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

APA (6^{th} Edition):

McClurkin, G. E. (2017). Generalizations and Variations of the Zero-Divisor Graph. (Doctoral Dissertation). University of Tennessee – Knoxville. Retrieved from https://trace.tennessee.edu/utk_graddiss/4701

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

McClurkin, Grace Elizabeth. “Generalizations and Variations of the Zero-Divisor Graph.” 2017. Doctoral Dissertation, University of Tennessee – Knoxville. Accessed February 27, 2020. https://trace.tennessee.edu/utk_graddiss/4701.

MLA Handbook (7^{th} Edition):

McClurkin, Grace Elizabeth. “Generalizations and Variations of the Zero-Divisor Graph.” 2017. Web. 27 Feb 2020.

Vancouver:

McClurkin GE. Generalizations and Variations of the Zero-Divisor Graph. [Internet] [Doctoral dissertation]. University of Tennessee – Knoxville; 2017. [cited 2020 Feb 27]. Available from: https://trace.tennessee.edu/utk_graddiss/4701.

Council of Science Editors:

McClurkin GE. Generalizations and Variations of the Zero-Divisor Graph. [Doctoral Dissertation]. University of Tennessee – Knoxville; 2017. Available from: https://trace.tennessee.edu/utk_graddiss/4701

Indian Institute of Science

27.
Khopkar, Abhijeet.
Computational And Combinatorial Problems On Some Geometric Proximity * Graphs*.

Degree: 2013, Indian Institute of Science

URL: http://etd.iisc.ernet.in/handle/2005/2622 ; http://etd.ncsi.iisc.ernet.in/abstracts/3401/G26269-Abs.pdf

► In this thesis, we focus on the study of computational and combinatorial problems on various geometric proximity *graphs*. Delaunay and Gabriel *graphs* are widely studied…
(more)

Subjects/Keywords: Geometric Proximity Graphs; Computational Geometry; Geometric Graphs; Gabriel Graphs; Locally Gabriel Graphs; Unit Distance Graphs; Ordered Bipartite Graphs; Convex Point Sets; Combinatorial Geometry; Locally Gabriel Geometric Graphs; Computer Science

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Khopkar, A. (2013). Computational And Combinatorial Problems On Some Geometric Proximity Graphs. (Thesis). Indian Institute of Science. Retrieved from http://etd.iisc.ernet.in/handle/2005/2622 ; http://etd.ncsi.iisc.ernet.in/abstracts/3401/G26269-Abs.pdf

Not specified: Masters Thesis or Doctoral Dissertation

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

Khopkar, Abhijeet. “Computational And Combinatorial Problems On Some Geometric Proximity Graphs.” 2013. Thesis, Indian Institute of Science. Accessed February 27, 2020. http://etd.iisc.ernet.in/handle/2005/2622 ; http://etd.ncsi.iisc.ernet.in/abstracts/3401/G26269-Abs.pdf.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Khopkar, Abhijeet. “Computational And Combinatorial Problems On Some Geometric Proximity Graphs.” 2013. Web. 27 Feb 2020.

Vancouver:

Khopkar A. Computational And Combinatorial Problems On Some Geometric Proximity Graphs. [Internet] [Thesis]. Indian Institute of Science; 2013. [cited 2020 Feb 27]. Available from: http://etd.iisc.ernet.in/handle/2005/2622 ; http://etd.ncsi.iisc.ernet.in/abstracts/3401/G26269-Abs.pdf.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Khopkar A. Computational And Combinatorial Problems On Some Geometric Proximity Graphs. [Thesis]. Indian Institute of Science; 2013. Available from: http://etd.iisc.ernet.in/handle/2005/2622 ; http://etd.ncsi.iisc.ernet.in/abstracts/3401/G26269-Abs.pdf

Not specified: Masters Thesis or Doctoral Dissertation

Indian Institute of Science

28.
Khopkar, Abhijeet.
Computational And Combinatorial Problems On Some Geometric Proximity * Graphs*.

Degree: 2013, Indian Institute of Science

URL: http://hdl.handle.net/2005/2622

► In this thesis, we focus on the study of computational and combinatorial problems on various geometric proximity *graphs*. Delaunay and Gabriel *graphs* are widely studied…
(more)

Subjects/Keywords: Geometric Proximity Graphs; Computational Geometry; Geometric Graphs; Gabriel Graphs; Locally Gabriel Graphs; Unit Distance Graphs; Ordered Bipartite Graphs; Convex Point Sets; Combinatorial Geometry; Locally Gabriel Geometric Graphs; Computer Science

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Khopkar, A. (2013). Computational And Combinatorial Problems On Some Geometric Proximity Graphs. (Thesis). Indian Institute of Science. Retrieved from http://hdl.handle.net/2005/2622

Not specified: Masters Thesis or Doctoral Dissertation

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

Khopkar, Abhijeet. “Computational And Combinatorial Problems On Some Geometric Proximity Graphs.” 2013. Thesis, Indian Institute of Science. Accessed February 27, 2020. http://hdl.handle.net/2005/2622.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Khopkar, Abhijeet. “Computational And Combinatorial Problems On Some Geometric Proximity Graphs.” 2013. Web. 27 Feb 2020.

Vancouver:

Khopkar A. Computational And Combinatorial Problems On Some Geometric Proximity Graphs. [Internet] [Thesis]. Indian Institute of Science; 2013. [cited 2020 Feb 27]. Available from: http://hdl.handle.net/2005/2622.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Khopkar A. Computational And Combinatorial Problems On Some Geometric Proximity Graphs. [Thesis]. Indian Institute of Science; 2013. Available from: http://hdl.handle.net/2005/2622

Not specified: Masters Thesis or Doctoral Dissertation

Indian Institute of Science

29. Rajendraprasad, Deepak. Rainbow Colouring and Some Dimensional Problems in Graph Theory.

Degree: 2013, Indian Institute of Science

URL: http://etd.iisc.ernet.in/2005/3336 ; http://etd.iisc.ernet.in/abstracts/4201/G25730-Abs.pdf

► This thesis touches three diﬀerent topics in graph theory, namely, rainbow colouring, product dimension and boxicity. Rainbow colouring An edge colouring of a graph is…
(more)

Subjects/Keywords: Graph Theory; Rainbow Coloring - Graphs; Product Dimension - Graphs; Boxicity; Cubicity; Hypergraphs; Product Graphs; Forests Graphs; Treewidth Graphs; Tree (Graph Theory); Split Graphs; Threshold Graphs; Graph - Coloring; Rainbow Connection; Computer Science

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Rajendraprasad, D. (2013). Rainbow Colouring and Some Dimensional Problems in Graph Theory. (Thesis). Indian Institute of Science. Retrieved from http://etd.iisc.ernet.in/2005/3336 ; http://etd.iisc.ernet.in/abstracts/4201/G25730-Abs.pdf

Not specified: Masters Thesis or Doctoral Dissertation

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

Rajendraprasad, Deepak. “Rainbow Colouring and Some Dimensional Problems in Graph Theory.” 2013. Thesis, Indian Institute of Science. Accessed February 27, 2020. http://etd.iisc.ernet.in/2005/3336 ; http://etd.iisc.ernet.in/abstracts/4201/G25730-Abs.pdf.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Rajendraprasad, Deepak. “Rainbow Colouring and Some Dimensional Problems in Graph Theory.” 2013. Web. 27 Feb 2020.

Vancouver:

Rajendraprasad D. Rainbow Colouring and Some Dimensional Problems in Graph Theory. [Internet] [Thesis]. Indian Institute of Science; 2013. [cited 2020 Feb 27]. Available from: http://etd.iisc.ernet.in/2005/3336 ; http://etd.iisc.ernet.in/abstracts/4201/G25730-Abs.pdf.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Rajendraprasad D. Rainbow Colouring and Some Dimensional Problems in Graph Theory. [Thesis]. Indian Institute of Science; 2013. Available from: http://etd.iisc.ernet.in/2005/3336 ; http://etd.iisc.ernet.in/abstracts/4201/G25730-Abs.pdf

Not specified: Masters Thesis or Doctoral Dissertation

Temple University

30.
Gidelew, Getnet Abebe.
Topics in Harmonic Analysis on Combinatorial * Graphs*.

Degree: PhD, 2014, Temple University

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

►

Mathematics

In recent years harmonic analysis on combinatorial *graphs* has attracted considerable attention. The interest is stimulated in part by multiple existing and potential applications…
(more)

Subjects/Keywords: Mathematics;

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Gidelew, G. A. (2014). Topics in Harmonic Analysis on Combinatorial Graphs. (Doctoral Dissertation). Temple University. Retrieved from http://digital.library.temple.edu/u?/p245801coll10,262601

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

Gidelew, Getnet Abebe. “Topics in Harmonic Analysis on Combinatorial Graphs.” 2014. Doctoral Dissertation, Temple University. Accessed February 27, 2020. http://digital.library.temple.edu/u?/p245801coll10,262601.

MLA Handbook (7^{th} Edition):

Gidelew, Getnet Abebe. “Topics in Harmonic Analysis on Combinatorial Graphs.” 2014. Web. 27 Feb 2020.

Vancouver:

Gidelew GA. Topics in Harmonic Analysis on Combinatorial Graphs. [Internet] [Doctoral dissertation]. Temple University; 2014. [cited 2020 Feb 27]. Available from: http://digital.library.temple.edu/u?/p245801coll10,262601.

Council of Science Editors:

Gidelew GA. Topics in Harmonic Analysis on Combinatorial Graphs. [Doctoral Dissertation]. Temple University; 2014. Available from: http://digital.library.temple.edu/u?/p245801coll10,262601