Advanced search options

Advanced Search Options 🞨

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

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:(Graphs). Showing records 1 – 30 of 1853 total matches.

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

Search Limiters

Last 2 Years | English Only

Degrees

Levels

Languages

Country

▼ Search Limiters

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

Degree: Mathematical Science, 2010, INFLIBNET

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

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

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

Arvind, N R. “Forbidden subgraph colorings, oriented colorings and intersection dimensions of graphs; -.” 2010. Thesis, INFLIBNET. Accessed April 21, 2021. 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 (7th Edition):

Arvind, N R. “Forbidden subgraph colorings, oriented colorings and intersection dimensions of graphs; -.” 2010. Web. 21 Apr 2021.

Vancouver:

Arvind NR. Forbidden subgraph colorings, oriented colorings and intersection dimensions of graphs; -. [Internet] [Thesis]. INFLIBNET; 2010. [cited 2021 Apr 21]. 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

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

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

Degree: PhD, Computer Science, 2013, Brown University

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

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

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

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

MLA Handbook (7th Edition):

Mozes, Shay. “Efficient Algorithms for Shortest-Path and Maximum-Flow Problems in Planar Graphs.” 2013. Web. 21 Apr 2021.

Vancouver:

Mozes S. Efficient Algorithms for Shortest-Path and Maximum-Flow Problems in Planar Graphs. [Internet] [Doctoral dissertation]. Brown University; 2013. [cited 2021 Apr 21]. 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/

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

 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… 

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th 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 April 21, 2021. http://hdl.handle.net/10902/6542.

MLA Handbook (7th 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. 21 Apr 2021.

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 2021 Apr 21]. 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


University of Florida

4. Alipanahi Ramandi, Bahareh. Variants and Applications of Colored De Bruijn Graphs.

Degree: PhD, Computer Science - Computer and Information Science and Engineering, 2020, University of Florida

 Colored de Bruijn graphs,extensions of the de Bruijn graphs are fundamental data structures for the analysis of high-throughput sequencing data. Although colored de Bruin graphs(more)

Subjects/Keywords: coloredgraphs  – graphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Alipanahi Ramandi, B. (2020). Variants and Applications of Colored De Bruijn Graphs. (Doctoral Dissertation). University of Florida. Retrieved from https://ufdc.ufl.edu/UFE0056439

Chicago Manual of Style (16th Edition):

Alipanahi Ramandi, Bahareh. “Variants and Applications of Colored De Bruijn Graphs.” 2020. Doctoral Dissertation, University of Florida. Accessed April 21, 2021. https://ufdc.ufl.edu/UFE0056439.

MLA Handbook (7th Edition):

Alipanahi Ramandi, Bahareh. “Variants and Applications of Colored De Bruijn Graphs.” 2020. Web. 21 Apr 2021.

Vancouver:

Alipanahi Ramandi B. Variants and Applications of Colored De Bruijn Graphs. [Internet] [Doctoral dissertation]. University of Florida; 2020. [cited 2021 Apr 21]. Available from: https://ufdc.ufl.edu/UFE0056439.

Council of Science Editors:

Alipanahi Ramandi B. Variants and Applications of Colored De Bruijn Graphs. [Doctoral Dissertation]. University of Florida; 2020. Available from: https://ufdc.ufl.edu/UFE0056439


University of Oxford

5. Saller, Sophia. Local limit theorem in random graphs and graphs on non-constant surfaces.

Degree: PhD, 2020, University of Oxford

 The thesis is split into two parts. In the first part we prove a local limit theorem for the number of appearances of the complete… (more)

Subjects/Keywords: Random graphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Saller, S. (2020). Local limit theorem in random graphs and graphs on non-constant surfaces. (Doctoral Dissertation). University of Oxford. Retrieved from http://ora.ox.ac.uk/objects/uuid:147400e3-0a9b-46d1-b0c9-9acba7b94516 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.813535

Chicago Manual of Style (16th Edition):

Saller, Sophia. “Local limit theorem in random graphs and graphs on non-constant surfaces.” 2020. Doctoral Dissertation, University of Oxford. Accessed April 21, 2021. http://ora.ox.ac.uk/objects/uuid:147400e3-0a9b-46d1-b0c9-9acba7b94516 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.813535.

MLA Handbook (7th Edition):

Saller, Sophia. “Local limit theorem in random graphs and graphs on non-constant surfaces.” 2020. Web. 21 Apr 2021.

Vancouver:

Saller S. Local limit theorem in random graphs and graphs on non-constant surfaces. [Internet] [Doctoral dissertation]. University of Oxford; 2020. [cited 2021 Apr 21]. Available from: http://ora.ox.ac.uk/objects/uuid:147400e3-0a9b-46d1-b0c9-9acba7b94516 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.813535.

Council of Science Editors:

Saller S. Local limit theorem in random graphs and graphs on non-constant surfaces. [Doctoral Dissertation]. University of Oxford; 2020. Available from: http://ora.ox.ac.uk/objects/uuid:147400e3-0a9b-46d1-b0c9-9acba7b94516 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.813535


Rutgers University

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

Degree: PhD, Mathematics, 2016, Rutgers University

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

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

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

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

MLA Handbook (7th Edition):

Baron, Jacob D., 1988-. “Two problems on cycles in random graphs.” 2016. Web. 21 Apr 2021.

Vancouver:

Baron, Jacob D. 1. Two problems on cycles in random graphs. [Internet] [Doctoral dissertation]. Rutgers University; 2016. [cited 2021 Apr 21]. 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/


Indian Institute of Science

7. Francis, Mathew C. Intersection Graphs Of Boxes And Cubes.

Degree: PhD, Faculty of Engineering, 2011, Indian Institute of Science

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

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

APA (6th Edition):

Francis, M. C. (2011). Intersection Graphs Of Boxes And Cubes. (Doctoral Dissertation). Indian Institute of Science. Retrieved from http://etd.iisc.ac.in/handle/2005/1027

Chicago Manual of Style (16th Edition):

Francis, Mathew C. “Intersection Graphs Of Boxes And Cubes.” 2011. Doctoral Dissertation, Indian Institute of Science. Accessed April 21, 2021. http://etd.iisc.ac.in/handle/2005/1027.

MLA Handbook (7th Edition):

Francis, Mathew C. “Intersection Graphs Of Boxes And Cubes.” 2011. Web. 21 Apr 2021.

Vancouver:

Francis MC. Intersection Graphs Of Boxes And Cubes. [Internet] [Doctoral dissertation]. Indian Institute of Science; 2011. [cited 2021 Apr 21]. Available from: http://etd.iisc.ac.in/handle/2005/1027.

Council of Science Editors:

Francis MC. Intersection Graphs Of Boxes And Cubes. [Doctoral Dissertation]. Indian Institute of Science; 2011. Available from: http://etd.iisc.ac.in/handle/2005/1027


University of Georgia

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

Degree: 2014, University of Georgia

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

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

APA (6th Edition):

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

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

Chicago Manual of Style (16th Edition):

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

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

MLA Handbook (7th Edition):

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

Vancouver:

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

Note: this citation may be lacking information needed for this citation format:
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

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


Jawaharlal Nehru University

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

Degree: Computer Science, 1993, Jawaharlal Nehru University

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

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

APA (6th 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

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

Chicago Manual of Style (16th Edition):

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

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

MLA Handbook (7th Edition):

Krishna Reddy, Polepalli. “Synchronization based on data flow graphs for distributed and replicated databases; -.” 1993. Web. 21 Apr 2021.

Vancouver:

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

Note: this citation may be lacking information needed for this citation format:
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

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


Iowa State University

10. Blumenthal, Adam. Domination problems in directed graphs and inducibility of nets.

Degree: 2020, Iowa State University

 In this thesis we discuss two topics: domination parameters and inducibility. In the first chapter, we introduce basic concepts, definitions, and a brief history for… (more)

Subjects/Keywords: Directed Graphs; Domination; Extremal Combinatorics; Graphs; Inducibility

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Blumenthal, A. (2020). Domination problems in directed graphs and inducibility of nets. (Thesis). Iowa State University. Retrieved from https://lib.dr.iastate.edu/etd/17952

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

Chicago Manual of Style (16th Edition):

Blumenthal, Adam. “Domination problems in directed graphs and inducibility of nets.” 2020. Thesis, Iowa State University. Accessed April 21, 2021. https://lib.dr.iastate.edu/etd/17952.

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

MLA Handbook (7th Edition):

Blumenthal, Adam. “Domination problems in directed graphs and inducibility of nets.” 2020. Web. 21 Apr 2021.

Vancouver:

Blumenthal A. Domination problems in directed graphs and inducibility of nets. [Internet] [Thesis]. Iowa State University; 2020. [cited 2021 Apr 21]. Available from: https://lib.dr.iastate.edu/etd/17952.

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

Council of Science Editors:

Blumenthal A. Domination problems in directed graphs and inducibility of nets. [Thesis]. Iowa State University; 2020. Available from: https://lib.dr.iastate.edu/etd/17952

Note: this citation may be lacking information needed for this citation format:
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

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

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

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

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

MLA Handbook (7th Edition):

Iverson, Perry K. “Refining the characterization of projective graphs.” 2013. Web. 21 Apr 2021.

Vancouver:

Iverson PK. Refining the characterization of projective graphs. [Internet] [Doctoral dissertation]. Louisiana State University; 2013. [cited 2021 Apr 21]. 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

 It is well known that the class of outerplanar graphs is minor-closed and can be characterized by two excluded minors: K4 and K2,3. The class… (more)

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

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

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

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

MLA Handbook (7th Edition):

Dziobiak, Stanislaw. “Excluded-minor characterization of apex-outerplanar graphs.” 2011. Web. 21 Apr 2021.

Vancouver:

Dziobiak S. Excluded-minor characterization of apex-outerplanar graphs. [Internet] [Doctoral dissertation]. Louisiana State University; 2011. [cited 2021 Apr 21]. 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 Waterloo

13. Lato, Sabrina. Quantum Walks on Oriented Graphs.

Degree: 2019, University of Waterloo

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

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

APA (6th Edition):

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

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

Chicago Manual of Style (16th Edition):

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

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

MLA Handbook (7th Edition):

Lato, Sabrina. “Quantum Walks on Oriented Graphs.” 2019. Web. 21 Apr 2021.

Vancouver:

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

Note: this citation may be lacking information needed for this citation format:
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

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


University of Newcastle

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

Degree: PhD, 2015, University of Newcastle

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

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

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

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

MLA Handbook (7th Edition):

Feria Puron, Ramiro. “Large interconnection networks with given degree and diameter.” 2015. Web. 21 Apr 2021.

Vancouver:

Feria Puron R. Large interconnection networks with given degree and diameter. [Internet] [Doctoral dissertation]. University of Newcastle; 2015. [cited 2021 Apr 21]. 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


Victoria University of Wellington

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

Degree: 2013, Victoria University of Wellington

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

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

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

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

MLA Handbook (7th Edition):

Snook, Michael. “Matroids, Complexity and Computation.” 2013. Web. 21 Apr 2021.

Vancouver:

Snook M. Matroids, Complexity and Computation. [Internet] [Doctoral dissertation]. Victoria University of Wellington; 2013. [cited 2021 Apr 21]. 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

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

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

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

APA (6th 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 (16th 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 April 21, 2021. http://www.theses.fr/2011LIL10074.

MLA Handbook (7th 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. 21 Apr 2021.

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 2021 Apr 21]. 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 Victoria

17. Neilson, Linda. Broadcast independence in graphs.

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

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

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

APA (6th Edition):

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

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

Chicago Manual of Style (16th Edition):

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

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

MLA Handbook (7th Edition):

Neilson, Linda. “Broadcast independence in graphs.” 2019. Web. 21 Apr 2021.

Vancouver:

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

Note: this citation may be lacking information needed for this citation format:
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

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


University of Victoria

18. Hassanlou, Nasrin. Probabilistic graph summarization.

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

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

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

APA (6th Edition):

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

Chicago Manual of Style (16th Edition):

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

MLA Handbook (7th Edition):

Hassanlou, Nasrin. “Probabilistic graph summarization.” 2013. Web. 21 Apr 2021.

Vancouver:

Hassanlou N. Probabilistic graph summarization. [Internet] [Masters thesis]. University of Victoria; 2013. [cited 2021 Apr 21]. 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 Florida

19. Rodriguez, Miguel. Reasoning over Multi-Source and Dynamic Knowledge Graphs.

Degree: PhD, Computer Engineering - Computer and Information Science and Engineering, 2019, University of Florida

 Innovative approaches to Information Extraction (IE) have enabled the creation of large Knowledge Graphs (KGs) (e.g., YAGO, NELL, DBPedia, Wikidata) and Dynamic Knowledge Graphs (e.g.,… (more)

Subjects/Keywords: fusion  – graphs  – sequence

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Rodriguez, M. (2019). Reasoning over Multi-Source and Dynamic Knowledge Graphs. (Doctoral Dissertation). University of Florida. Retrieved from https://ufdc.ufl.edu/UFE0056138

Chicago Manual of Style (16th Edition):

Rodriguez, Miguel. “Reasoning over Multi-Source and Dynamic Knowledge Graphs.” 2019. Doctoral Dissertation, University of Florida. Accessed April 21, 2021. https://ufdc.ufl.edu/UFE0056138.

MLA Handbook (7th Edition):

Rodriguez, Miguel. “Reasoning over Multi-Source and Dynamic Knowledge Graphs.” 2019. Web. 21 Apr 2021.

Vancouver:

Rodriguez M. Reasoning over Multi-Source and Dynamic Knowledge Graphs. [Internet] [Doctoral dissertation]. University of Florida; 2019. [cited 2021 Apr 21]. Available from: https://ufdc.ufl.edu/UFE0056138.

Council of Science Editors:

Rodriguez M. Reasoning over Multi-Source and Dynamic Knowledge Graphs. [Doctoral Dissertation]. University of Florida; 2019. Available from: https://ufdc.ufl.edu/UFE0056138


The Ohio State University

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

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

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

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

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

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

MLA Handbook (7th Edition):

Poole, Daniel James. “A Study of Random Hypergraphs and Directed Graphs.” 2014. Web. 21 Apr 2021.

Vancouver:

Poole DJ. A Study of Random Hypergraphs and Directed Graphs. [Internet] [Doctoral dissertation]. The Ohio State University; 2014. [cited 2021 Apr 21]. 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


Western Michigan University

21. Byers, Alexis D. Graceful Colorings and Connection in Graphs.

Degree: PhD, Mathematics, 2018, Western Michigan University

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

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

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

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

MLA Handbook (7th Edition):

Byers, Alexis D. “Graceful Colorings and Connection in Graphs.” 2018. Web. 21 Apr 2021.

Vancouver:

Byers AD. Graceful Colorings and Connection in Graphs. [Internet] [Doctoral dissertation]. Western Michigan University; 2018. [cited 2021 Apr 21]. 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

22. Skrepetos, Dimitrios. Shortest Paths in Geometric Intersection Graphs.

Degree: 2018, University of Waterloo

 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

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

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

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

Chicago Manual of Style (16th Edition):

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

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

MLA Handbook (7th Edition):

Skrepetos, Dimitrios. “Shortest Paths in Geometric Intersection Graphs.” 2018. Web. 21 Apr 2021.

Vancouver:

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

Note: this citation may be lacking information needed for this citation format:
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

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


University of Kansas

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

Degree: MA, Mathematics, 2015, University of Kansas

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

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

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

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

MLA Handbook (7th Edition):

Adams, Kevin Daniel. “On Kernels, β-graphs, and β-graph Sequences of Digraphs.” 2015. Web. 21 Apr 2021.

Vancouver:

Adams KD. On Kernels, β-graphs, and β-graph Sequences of Digraphs. [Internet] [Masters thesis]. University of Kansas; 2015. [cited 2021 Apr 21]. 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


Indian Institute of Science

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

Degree: PhD, Faculty of Engineering, 2014, Indian Institute of Science

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

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

APA (6th Edition):

Mathew, R. (2014). Boxicity And Cubicity : A Study On Special Classes Of Graphs. (Doctoral Dissertation). Indian Institute of Science. Retrieved from http://etd.iisc.ac.in/handle/2005/2320

Chicago Manual of Style (16th Edition):

Mathew, Rogers. “Boxicity And Cubicity : A Study On Special Classes Of Graphs.” 2014. Doctoral Dissertation, Indian Institute of Science. Accessed April 21, 2021. http://etd.iisc.ac.in/handle/2005/2320.

MLA Handbook (7th Edition):

Mathew, Rogers. “Boxicity And Cubicity : A Study On Special Classes Of Graphs.” 2014. Web. 21 Apr 2021.

Vancouver:

Mathew R. Boxicity And Cubicity : A Study On Special Classes Of Graphs. [Internet] [Doctoral dissertation]. Indian Institute of Science; 2014. [cited 2021 Apr 21]. Available from: http://etd.iisc.ac.in/handle/2005/2320.

Council of Science Editors:

Mathew R. Boxicity And Cubicity : A Study On Special Classes Of Graphs. [Doctoral Dissertation]. Indian Institute of Science; 2014. Available from: http://etd.iisc.ac.in/handle/2005/2320


University of Tennessee – Knoxville

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

Degree: 2017, University of Tennessee – Knoxville

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

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

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

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

MLA Handbook (7th Edition):

McClurkin, Grace Elizabeth. “Generalizations and Variations of the Zero-Divisor Graph.” 2017. Web. 21 Apr 2021.

Vancouver:

McClurkin GE. Generalizations and Variations of the Zero-Divisor Graph. [Internet] [Doctoral dissertation]. University of Tennessee – Knoxville; 2017. [cited 2021 Apr 21]. 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

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

Degree: PhD, Faculty of Engineering, 2018, Indian Institute of Science

 This thesis touches three different 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Rajendraprasad, D. (2018). Rainbow Colouring and Some Dimensional Problems in Graph Theory. (Doctoral Dissertation). Indian Institute of Science. Retrieved from http://etd.iisc.ac.in/handle/2005/3336

Chicago Manual of Style (16th Edition):

Rajendraprasad, Deepak. “Rainbow Colouring and Some Dimensional Problems in Graph Theory.” 2018. Doctoral Dissertation, Indian Institute of Science. Accessed April 21, 2021. http://etd.iisc.ac.in/handle/2005/3336.

MLA Handbook (7th Edition):

Rajendraprasad, Deepak. “Rainbow Colouring and Some Dimensional Problems in Graph Theory.” 2018. Web. 21 Apr 2021.

Vancouver:

Rajendraprasad D. Rainbow Colouring and Some Dimensional Problems in Graph Theory. [Internet] [Doctoral dissertation]. Indian Institute of Science; 2018. [cited 2021 Apr 21]. Available from: http://etd.iisc.ac.in/handle/2005/3336.

Council of Science Editors:

Rajendraprasad D. Rainbow Colouring and Some Dimensional Problems in Graph Theory. [Doctoral Dissertation]. Indian Institute of Science; 2018. Available from: http://etd.iisc.ac.in/handle/2005/3336


Indian Institute of Science

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

Degree: PhD, Faculty of Engineering, 2017, Indian Institute of Science

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

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

APA (6th Edition):

Khopkar, A. (2017). Computational And Combinatorial Problems On Some Geometric Proximity Graphs. (Doctoral Dissertation). Indian Institute of Science. Retrieved from http://etd.iisc.ac.in/handle/2005/2622

Chicago Manual of Style (16th Edition):

Khopkar, Abhijeet. “Computational And Combinatorial Problems On Some Geometric Proximity Graphs.” 2017. Doctoral Dissertation, Indian Institute of Science. Accessed April 21, 2021. http://etd.iisc.ac.in/handle/2005/2622.

MLA Handbook (7th Edition):

Khopkar, Abhijeet. “Computational And Combinatorial Problems On Some Geometric Proximity Graphs.” 2017. Web. 21 Apr 2021.

Vancouver:

Khopkar A. Computational And Combinatorial Problems On Some Geometric Proximity Graphs. [Internet] [Doctoral dissertation]. Indian Institute of Science; 2017. [cited 2021 Apr 21]. Available from: http://etd.iisc.ac.in/handle/2005/2622.

Council of Science Editors:

Khopkar A. Computational And Combinatorial Problems On Some Geometric Proximity Graphs. [Doctoral Dissertation]. Indian Institute of Science; 2017. Available from: http://etd.iisc.ac.in/handle/2005/2622


Temple University

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

Degree: PhD, 2014, Temple University

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

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

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

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

MLA Handbook (7th Edition):

Gidelew, Getnet Abebe. “Topics in Harmonic Analysis on Combinatorial Graphs.” 2014. Web. 21 Apr 2021.

Vancouver:

Gidelew GA. Topics in Harmonic Analysis on Combinatorial Graphs. [Internet] [Doctoral dissertation]. Temple University; 2014. [cited 2021 Apr 21]. 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


Anna University

29. Sankar, K. Study on graceful harmonious and cordial graphs; -.

Degree: Science and Humanities, 2014, Anna University

Much interest in graph labelings began in mid 1960s with the conjecture of Ringel and a paper by Rosa The popular Ringel Kotzig conjecture that… (more)

Subjects/Keywords: Cordial graphs; Graceful graphs; Graceful labeling; Harmonious graphs; Harmonious labeling; Mathematics; Science and humanities

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sankar, K. (2014). Study on graceful harmonious and cordial graphs; -. (Thesis). Anna University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/24801

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

Chicago Manual of Style (16th Edition):

Sankar, K. “Study on graceful harmonious and cordial graphs; -.” 2014. Thesis, Anna University. Accessed April 21, 2021. http://shodhganga.inflibnet.ac.in/handle/10603/24801.

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

MLA Handbook (7th Edition):

Sankar, K. “Study on graceful harmonious and cordial graphs; -.” 2014. Web. 21 Apr 2021.

Vancouver:

Sankar K. Study on graceful harmonious and cordial graphs; -. [Internet] [Thesis]. Anna University; 2014. [cited 2021 Apr 21]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/24801.

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

Council of Science Editors:

Sankar K. Study on graceful harmonious and cordial graphs; -. [Thesis]. Anna University; 2014. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/24801

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


Georgia Tech

30. Xie, Shijie. 6-connected graphs are two-three linked.

Degree: PhD, Mathematics, 2019, Georgia Tech

 Let G be a graph and a0, a1, a2, b1, and b2 be distinct vertices of G. Motivated by their work on Four Color Theorem,… (more)

Subjects/Keywords: Graph theory; Disjoint paths in graphs; Two-three linked graphs; 6-connected graphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Xie, S. (2019). 6-connected graphs are two-three linked. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/62273

Chicago Manual of Style (16th Edition):

Xie, Shijie. “6-connected graphs are two-three linked.” 2019. Doctoral Dissertation, Georgia Tech. Accessed April 21, 2021. http://hdl.handle.net/1853/62273.

MLA Handbook (7th Edition):

Xie, Shijie. “6-connected graphs are two-three linked.” 2019. Web. 21 Apr 2021.

Vancouver:

Xie S. 6-connected graphs are two-three linked. [Internet] [Doctoral dissertation]. Georgia Tech; 2019. [cited 2021 Apr 21]. Available from: http://hdl.handle.net/1853/62273.

Council of Science Editors:

Xie S. 6-connected graphs are two-three linked. [Doctoral Dissertation]. Georgia Tech; 2019. Available from: http://hdl.handle.net/1853/62273

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

.