Browsing W&L Dept. of Mathematics by Title
Now showing items 10-16 of 16
-
Realizability of n-Vertex Graphs with Prescribed Vertex Connectivity, Edge Connectivity, Minimum Degree, and Maximum Degree (thesis)
Our work continues a long tradition in graph theory studying the relation- ship between vertex connectivity, edge connectivity, and minimum degree. [From Introduction] -
Realizability of n-Vertex Graphs with Prescribed Vertex Connectivity, Edge Connectivity, Minimum Degree, and Maximum Degree (thesis)
This is the fourth and nal thesis that concludes ProfessorWayne M. Dymacek's research project Realizability of n-Vertex Graphs with Prescribed Vertex Connectivity, Edge Connectivity, Minimum Degree, and Maximum Degree. ... -
Steinhaus Graphs and Pendent Vertices (thesis)
Steinhaus graphs have many interesting properties, yet there are many things about them that are not yet known. In [1], a formula was discovered for the total number of Steinhaus graphs on 11 vertices with at least one ... -
Towards an Automated and Customizable Linear Cryptanalysis of Substitution-Permutation Network Cipher (thesis)
The increasing scale of the Internet of Things exposes the proprietors and users to a number of security threats in terms of invasion of privacy, identity thefts and the like. It is therefore absolutely necessary that the ... -
Up-growing On-line Linear Discrepancy of Triple-optimal Partially Ordered Sets (thesis)
Whether we acknowledge it as a poset or not, posets arise in many natural contexts, and many also seem to warrant linear extensions (or rankings) of the poset. In some sense, the linear discrepancy of a linear extension L ...