Open Access. Powered by Scholars. Published by Universities.®

Digital Commons Network

Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics

UNLV Theses, Dissertations, Professional Papers, and Capstones

Theses/Dissertations

Graph theory

Publication Year

Articles 1 - 3 of 3

Full-Text Articles in Entire DC Network

Situational Assessment Using Graph Comparison, Pavan Kumar Pallapunidi May 2015

Situational Assessment Using Graph Comparison, Pavan Kumar Pallapunidi

UNLV Theses, Dissertations, Professional Papers, and Capstones

In strategic operations, the assessment of any given situation is very important and may trigger the development of a mission plan. The mission plan consists of various actions that should be executed in order to successfully mitigate the situation. For a new mission plan to be designed or implemented, the effect of the previous mission plan should be accessed. These mission plans use various sensors to collect the data which can be very large and aggregate them to obtain detailed information of the situation. In order to implement an effective mission plan the current situation has to be assessed effectively. …


A Study Of Graphical Permutations, Jessica Thune Dec 2014

A Study Of Graphical Permutations, Jessica Thune

UNLV Theses, Dissertations, Professional Papers, and Capstones

A permutation π on a set of positive integers {a_1,a_2,...,a_n} is said to be graphical if there exists a graph containing exactly a_i vertices of degree (a_i) for each i. It has been shown that for positive integers with a_1


Zero-Sum Magic Graphs And Their Null Sets, Samuel M. Hansen May 2011

Zero-Sum Magic Graphs And Their Null Sets, Samuel M. Hansen

UNLV Theses, Dissertations, Professional Papers, and Capstones

For any element h of the Natural numbers, a graph G=(V,E), with vertex set V and edge set E, is said to be h-magic if there exists a labeling of the edge set E, using the integer group mod h such that the induced vertex labeling, the sum of all edges incident to a vertex, is a constant map. When this constant is 0 we call G a zero-sum h-magic graph. The null set of G is the set of all natural numbers h for which G admits a zero-sum h-magic labeling. A graph G is said to be uniformly …