Filters
Locally regular graphs.
The graphs which are locally s-regular and simultaneously regular of degree r are studied.
BA - Obecná matematika
- 2000 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
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 scheme so that the corresponding metrically regular bipartite graph of diameter D = 7 (8 distinct eigenvalues of the adjacency matrix)...
Pure mathematics
- 2018 •
- Jimp •
- Link
Rok uplatnění
Jimp - Článek v periodiku v databázi Web of Science
Výsledek na webu
Strongly regular square of distance regular graphs
A necessary condition for G to have the square strongly regular is found and the problem of the construction such graphs G is solved....
BA - Obecná matematika
- 2007 •
- D
Rok uplatnění
D - Stať ve sborníku
Construction of Antimagic Labeling for the Cartesian Product of Regular Graphs
In this paper we prove constructively that certain families of Cartesian products of regular graphs are antimagic.
BA - Obecná matematika
- 2011 •
- Jx •
- Link
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Výsledek na webu
Existence of Regular Supermagic Graphs
A graph is called supermagic if it admits a labeling of the edges by pairwise different consecutive integers such that the sum of the labels at every vertex is independent of the particular vertex. We deal with the existence of regular
BA - Obecná matematika
- 2007 •
- D
Rok uplatnění
D - Stať ve sborníku
On the Existence of Regular Supermagic Graphs
A graph is called supermagic if it admits a labeling of the edges by pairwise different consecutive integers such that the sum of the labels at every vertex is independent of the particular vertex. We deal with the existence of regular
BA - Obecná matematika
- 2009 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Extremal Edge-Girth-Regular Graphs
An edge-girth-regular egr(v, k, g, λ)-graph Γ is a k-regular graph of order v-regularity is shared by several interesting classes of graphs which include edge- and arc-transitive graphs, ...
Pure mathematics
- 2021 •
- Jimp •
- Link
Rok uplatnění
Jimp - Článek v periodiku v databázi Web of Science
Výsledek na webu
On the Computational Complexity of the L(2,1)-Labeling Problem for Regular Graphs
Annotation is : The paper proves NP-hardness of the L(2,1)-labeling problem on regular graphs.
BA - Obecná matematika
- 2005 •
- D
Rok uplatnění
D - Stať ve sborníku
Note on decomposition of K_{n,n} into (0,j)-prisms
R. Häggkvist proved that every 3-regular bipartite graph of order 2n} into certain families of 3-regular graphs of order 2n. In this paper we tackle the problem of decompositions of K_{n,n} into 3-regular ...
BA - Obecná matematika
- 2009 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
On super (a,1)-edge-antimagic total labelings of regular graphs
atthe vertices. In this paper we prove that every even regular graph and every odd regular graph with a 1-factor are super (a,1)-edge-antimagic total. We also introduce some constructions of non-regular s...
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 17 762