Filters
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
Regular Grammar Transformation Using Graph Distance Computed by GA
This article introduce the method how to compute regular grammars distances graphs. Then the grammar distance is defined as graph distance between two graphs the exhaustive graph...
IN - Informatika
- 2010 •
- D
Rok uplatnění
D - Stať ve sborníku
On Regular Distance Magic Graphs of Odd Order
vertices adjacent to v. Any graph which admits a distance magic labeling is a distance magic graph. The existence of regular distance magic graphs of even order was solved, the existence...
Applied mathematics
- 2023 •
- JSC •
- Link
Rok uplatnění
JSC - Článek v periodiku v databázi SCOPUS
Výsledek na webu
Regular Grammar Transformation Inspired by the Graph Distance Using GA
This paper introduces a method how to transform one regular grammar to the second one. The transformation is based on regular grammar distance computation by oriented graphs or by transition matrices, respectively....
IN - Informatika
- 2011 •
- Jx •
- Link
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Výsledek na webu
Distance magic graphs of high regularity
. A graph that allowssuch a labeling is a distance magic graph. There is an elegant construction of r-regular distance magic graphs with an even number of vertices for all show that an (n-3)-r...
BA - Obecná matematika
- 2012 •
- 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
A note on 4-regular distance magic graphs
to ?. The constantk is the magic constant of f and any graph which admits a distance magic labeling is a distance magic graph. In this paper we solve some of the problems posted in a recent survey paper on dis...
BA - Obecná matematika
- 2012 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Constructing distance magic graphs from regular graphs
A graph G with k vertices is distance magic if the vertices can be labeled with numbers 1,2,..., k so that the sum of labels of the neighbors of each vertex is equal to the same constant ?0. We present a construction of distance...
BA - Obecná matematika
- 2011 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Handicap Labelings of 4-Regular Graphs
labelings of regular graphs are used for scheduling incomplete tournaments. While labelings and construct a new infinite class of 4-regular handicap graphs.Let G be a simple graph, let f : V (G) -> {1,...
Applied mathematics
- 2017 •
- JSC •
- Link
Rok uplatnění
JSC - Článek v periodiku v databázi SCOPUS
Výsledek na webu
On distance magic labeling of graphs
about the distance magicness of graphs that have minimum degree one or two. Moreover, we construct distance magic labeling for an infinite family of non-regular graphs.Distance magic labeling is ...
BA - Obecná matematika
- 2009 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
- 1 - 10 out of 31 372