Filters
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, diameter a...
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 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) -graphs. W...
BA - Obecná matematika
- 2009 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
On large bipartite graphs of diameter 3
present some structural properties of bipartite (d, 3,-4)-graphs, and later prove thatthere are no bipartite (7, 3,-4)-graphs. The approach here presented also provides a proof of the uniqueness of the known b...
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
New Largest Known Graphs of Diameter 6
In the pursuit of obtaining largest graphs of given maximum degree and diameter, many construction techniques have been developed. Compounding of graphs is one such technique. In this article, by means of the compounding of complete...
BA - Obecná matematika
- 2009 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Matching graphs of hypercubes and complete bipartite graphs
We proved that the matching graph of a complete bipartite graph Knn is connected and bipartite if and only if n is even....
BA - Obecná matematika
- 2009 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
On the existence of radial Moore graphs for every radius and every degree
of such graphs are attainable only for certain special graphs, called Moore graphs. Moore ''close'' to the nonexistent ideal of a Moore graph by holding fixed two. In thispaper we consid...
BA - Obecná matematika
- 2015 •
- Jx •
- Link
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Výsledek na webu
Homomorphisms of signed bipartite graphs
Study of the homomorphism relation between signed graphs where the underlying graph G is bipartite.
BA - Obecná matematika
- 2013 •
- D
Rok uplatnění
D - Stať ve sborníku
Moore bound for mixed networks
Mixed graphs contain both undirected as well as directed links between vertices and therefore are an interesting model for interconnection communication networks. In this paper, we establish the Moore bound for mixed graphs...
BA - Obecná matematika
- 2008 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Largest Planar Matching in Random Bipartite Graphs
Largest Planar Matching in Random Bipartite Graphs...
BA - Obecná matematika
- 2002 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Vertex Deletion into Bipartite Permutation Graphs
permutation graph is a permutation graph which is bipartite. In this paper we study, for a given n-vertex graph, whether we can remove at most k vertices to obtain a bipartite of the so-called almost ...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2020 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
- 1 - 10 out of 7 784