Current Search: Gottipati, Chenchu B. (x)


Title

Cohesion and Nonseparating Trees in connected graphs.

Creator

Gottipati, Chenchu B., Locke, Stephen C., Graduate College

Abstract/Description

If T is a tree on n vertices, n 3, and if G is a connected graph such that dudvd u,v 2n for every pair of distinct vertices of G, it has been conjectured that G must have a nonseparating copy of T. In this note, we prove this result for the special case in which dudv du,v 2n 2 for every pair of distinct vertices of G, and improve this slightly for trees of diameter at least four and for some trees of diameter three. We also characterize the graphs on at most 8 vertices with dudvdu,v 7 for...
Show moreIf T is a tree on n vertices, n 3, and if G is a connected graph such that dudvd u,v 2n for every pair of distinct vertices of G, it has been conjectured that G must have a nonseparating copy of T. In this note, we prove this result for the special case in which dudv du,v 2n 2 for every pair of distinct vertices of G, and improve this slightly for trees of diameter at least four and for some trees of diameter three. We also characterize the graphs on at most 8 vertices with dudvdu,v 7 for every pair of distinct vertices of G, and no nonseparating copy of K_{1,3}
Show less

Date Issued

2014

PURL

http://purl.flvc.org/fau/fd/FA00005818

Format

Document (PDF)


Title

Reduced path systems and superedgegraceful trees.

Creator

Gottipati, Chenchu B., Locke, Stephen C., Graduate College

Date Issued

20130412

PURL

http://purl.flvc.org/fcla/dt/3361301

Subject Headings

Mathematics, Path analysis

Format

Document (PDF)


Title

Graph labeling and nonseparating trees.

Creator

Gottipati, Chenchu B., Locke, Stephen C., Florida Atlantic University, Charles E. Schmidt College of Science, Department of Mathematical Sciences

Abstract/Description

This dissertation studies two independent problems, one is about graph labeling and the other problem is related to connectivity condition in a simple graph. Graph labeling is a rapidly developing area of research in graph theory, having connections with a variety of applicationoriented areas such as VLSI optimization, data structures and data representation. Furthermore, the connectivity conditions in a simple graphs may help us to study the new aspects of ad hoc networks, social networks...
Show moreThis dissertation studies two independent problems, one is about graph labeling and the other problem is related to connectivity condition in a simple graph. Graph labeling is a rapidly developing area of research in graph theory, having connections with a variety of applicationoriented areas such as VLSI optimization, data structures and data representation. Furthermore, the connectivity conditions in a simple graphs may help us to study the new aspects of ad hoc networks, social networks and web graphs. In chapter 2, we study path systems, reduced path systems and how to construct a super edgegraceful tree with any number of edges using path systems. First, we give an algorithm to reduce a labeled path system to a smaller labeled path system of a different type. First, we investigate the cases (m, k) = (3; 5) and (m, k) = (4; 7), where m is the number of paths and 2k is the length of each path, and then we give a generalization for any k, m = 3 and m = 4. We also describe a procedure to construct a superedgegraceful tree with any number of edges.
Show less

Date Issued

2014

PURL

http://purl.flvc.org/fau/fd/FA00004289, http://purl.flvc.org/fau/fd/FA00004289

Subject Headings

Computational complexity, Computer graphics, Graph theory, Integrated circuits  Very large scale integration, Mathematical optimization

Format

Document (PDF)