Filters
On large bipartite graphs of diameter 3
We consider the bipartite version of the degree/diameter problem. This paper present some structural properties of bipartite (d, 3,-4)-graphs, and later prove thatthere are no bipartite (...
BA - Obecná matematika
- 2013 •
- Jx •
- Link
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Výsledek na webu
On bipartite graphs of diameter 3 and defect 2
We consider bipartite graphs of degree d at least 2, diameter 3, and defect 2 (having 2 vertices less than the bipartite Moore bound). Such graphs are called bipartite (d,3,-2) -graph...
BA - Obecná matematika
- 2009 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
New Largest Known Graphs of Diameter 6
In the pursuit of obtaining largest graphs of given maximum degree and diameter into a bipartite Moore graph of diameter 6, we obtain a family of large graphs of the same diameter
BA - Obecná matematika
- 2009 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
On bipartite graphs of defect 2
It is known that the Moore bipartite bound provides an upper bound on the order of a connected bipartite graph. In this paper we deal with bipartite graphs of maximum degree at least 2, diamet...
BA - Obecná matematika
- 2009 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
t-Strong Cliques and the Degree-Diameter Problem
, and the degree/diameter problem. We prove that the size of a t-strong clique in a graph with maximum degree Delta is at most 1.75(Delta)t + O (Delta(t-1)), and for bipartite)) on the distance-t ...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2021 •
- Jimp •
- Link
Rok uplatnění
Jimp - Článek v periodiku v databázi Web of Science
Výsledek na webu
Metrically regular square of metrically regular bipartite graphs of diameter D = 7
The present paper deals with the spectra of powers of metrically regular graphs. We prove that there is only twoo tables of the parameters of an association scheme so that the corresponding metrically regular bipartite graph
Pure mathematics
- 2018 •
- Jimp •
- Link
Rok uplatnění
Jimp - Článek v periodiku v databázi Web of Science
Výsledek na webu
Moore graphs and beyond: A survey of the degree/diameter problem. 2nd edition (1st in 2005)
The degree/diameter problem is to determine the largest graphs or digraphs of given maximum degree and given diameter. This survey aims to give an overview of the current state-of-the-art of the <...
BA - Obecná matematika
- 2013 •
- Jx •
- Link
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Výsledek na webu
t-Strong cliques and the degree-diameter problem
the strong chromatic index and the degree/diameter problem. We prove that the size of a t-strong clique in a graph with maximum degree Delta is at most 1.75 Delta(t) + O (Delta t(-1)), and for biparti...
Pure mathematics
- 2019 •
- Jimp •
- Link
Rok uplatnění
Jimp - Článek v periodiku v databázi Web of Science
Výsledek na webu
NP-completeness of the edge precoloring extension problem on bipartite graphs
The edge precoloring extension problem on bipartite graphs was shown to be NP-complete...
BA - Obecná matematika
- 2003 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Note on bipartite graph tilings
We study what are the minimum degree conditions for a bipartite graph G which ensure that G has a K_{s,t}-factor. Exact result for large G is given....
BA - Obecná matematika
- 2010 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
- 1 - 10 out of 132 219