3 citations · 7 across the 9 of their papers we have counts for
9 papers
Sub-problems of the (3, 14) cage problem and their computer analysis
Vivek S. Nittoor
A (k, g) graph is a graph with regular degree k and girth g. The cage problem refers to finding the smallest (k, g) graph. The (3, 14) cage problem is known to be unresolved. In 20…
Some properties of catalog of (3, g) Hamiltonian bipartite graphs: orders, non-existence and infiniteness
Vivek S. Nittoor
The focus of this paper is on discussion of a catalog of a class of (3, g) graphs for even girth g. A (k, g) graph is a graph with regular degree k and girth g. This catalog is com…
A new approach to catalog small graphs of high even girth
Vivek S. Nittoor
A catalog of a class of (3,g) graphs for even girth g is introduced in this paper. A (k,g) graph is a regular graph with degree k and girth g. This catalog of (3,g) graphs for even…
Analysis Of The Girth For Regular Bi-partite Graphs With Degree 3
Vivek S Nittoor, Reiji Suda
The goal of this paper is to derive the detailed description of the Enumeration Based Search Algorithm from the high level description provided in [16], analyze the experimental re…
Enumeration Based Search Algorithm For Finding A Regular Bi-partite Graph Of Maximum Attainable Girth For Specified Degree And Number Of Vertices
Vivek S Nittoor, Reiji Suda
We introduce a search problem for finding a regular bi-partite graph of maximum attainable girth for specified degree and number of vertices, by restricting the search space using…
Partition Parameters for Girth Maximum (m, r) BTUs
Vivek S. Nittoor, Reiji Suda
This paper describes the calculation of the optimal partition parameters such that the girth maximum (m, r) Balanced Tanner Unit lies in family of BTUs specified by them using a se…