Open Access. Powered by Scholars. Published by Universities.®
- Discipline
- Institution
- Publication
- Publication Type
Articles 1 - 2 of 2
Full-Text Articles in Algebra
Construction Algorithms For Expander Graphs, Vlad S. Burca
Construction Algorithms For Expander Graphs, Vlad S. Burca
Senior Theses and Projects
Graphs are mathematical objects that are comprised of nodes and edges that connect them. In computer science they are used to model concepts that exhibit network behaviors, such as social networks, communication paths or computer networks. In practice, it is desired that these graphs retain two main properties: sparseness and high connectivity. This is equivalent to having relatively short distances between two nodes but with an overall small number of edges. These graphs are called expander graphs and the main motivation behind studying them is the efficient network structure that they can produce due to their properties. We are specifically …
Pseudo Lattice Graphs And Their Applications To Fuzzy And Neutrosophic Models, Florentin Smarandache, W.B. Vasantha Kandasamy, K. Ilanthenral
Pseudo Lattice Graphs And Their Applications To Fuzzy And Neutrosophic Models, Florentin Smarandache, W.B. Vasantha Kandasamy, K. Ilanthenral
Branch Mathematics and Statistics Faculty and Staff Publications
In this book for the first time authors introduce the concept of merged lattice, which gives a lattice or a graph. The resultant lattice or graph is defined as the pseudo lattice graph of type I. Here we also merge a graph with a lattice or two or more graphs which call as the pseudo lattice graph of type II. We merge either edges or vertices or both of a lattice and a graph or a lattice and a lattice or graph with itself. Such study is innovative and these mergings are adopted on all fuzzy and neutrosophic models which …