Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
New and explicit constructions of unbalanced Ramanujan bipartite graphs
View through CrossRef
AbstractThe objectives of this article are threefold. Firstly, we present for the first time explicit constructions of an infinite family of unbalanced Ramanujan bigraphs. Secondly, we revisit some of the known methods for constructing Ramanujan graphs and discuss the computational work required in actually implementing the various construction methods. The third goal of this article is to address the following question: can we construct a bipartite Ramanujan graph with specified degrees, but with the restriction that the edge set of this graph must be distinct from a given set of “prohibited” edges? We provide an affirmative answer in many cases, as long as the set of prohibited edges is not too large.
Springer Science and Business Media LLC
Title: New and explicit constructions of unbalanced Ramanujan bipartite graphs
Description:
AbstractThe objectives of this article are threefold.
Firstly, we present for the first time explicit constructions of an infinite family of unbalanced Ramanujan bigraphs.
Secondly, we revisit some of the known methods for constructing Ramanujan graphs and discuss the computational work required in actually implementing the various construction methods.
The third goal of this article is to address the following question: can we construct a bipartite Ramanujan graph with specified degrees, but with the restriction that the edge set of this graph must be distinct from a given set of “prohibited” edges? We provide an affirmative answer in many cases, as long as the set of prohibited edges is not too large.
Related Results
Complete (2,2) Bipartite Graphs
Complete (2,2) Bipartite Graphs
A bipartite graph G can be treated as a (1,1) bipartite graph in the sense that, no two vertices in the same part are at distance one from each other. A (2,2) bipartite graph is an...
Independent Set in Neutrosophic Graphs
Independent Set in Neutrosophic Graphs
New setting is introduced to study neutrosophic independent number and independent neutrosophic-number arising neighborhood of different vertices. Neighbor is a key term to have th...
Failed Independent Number in Neutrosophic Graphs
Failed Independent Number in Neutrosophic Graphs
New setting is introduced to study neutrosophic failed-independent number and failed independent neutrosophic-number arising neighborhood of different vertices. Neighbor is a key t...
Fidelity and entanglement of random bipartite pure states: insights and applications
Fidelity and entanglement of random bipartite pure states: insights and applications
Abstract
We investigate the fidelity of Haar random bipartite pure states from a fixed reference quantum state and their bipartite entanglement. By plotting the fide...
Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage
Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage
Abstract
Chordal graphs are characterized as the intersection graphs of subtrees in a tree and such a representation is known as the tree model. Restricting the characteriz...
Eye movements during visuomotor adaptation represent only part of the explicit learning
Eye movements during visuomotor adaptation represent only part of the explicit learning
Abstract
Visuomotor rotations are learned through a combination of explicit strategy and implicit recalibration. However, measuring the relative contribution of eac...
On Bipartite Distance-Regular Cayley Graphs with Small Diameter
On Bipartite Distance-Regular Cayley Graphs with Small Diameter
We study bipartite distance-regular Cayley graphs with diameter three or four. We give sufficient conditions under which a bipartite Cayley graph can be constructed on the semidire...
On the reciprocal distance spectrum of edge corona of graphs
On the reciprocal distance spectrum of edge corona of graphs
The reciprocal distance spectrum (Harary spectrum) of a connected graph [Formula: see text] is the multiset of eigenvalues of its reciprocal distance matrix (Harary matrix) [Formul...