Filters
On magicness and antimagicness of the union of 4-regular circulant graphs
In this paper, we study the vertex-magicness and vertex-antimagicness of the union of 4-regular circulant graphs.
BA - Obecná matematika
- 2011 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Vertex-transitive Haar graphs that are not Cayley graphs
a question whether there exist vertex-transitive Haar graphs that are not Cayley graphs. In this note we construct an infinite family of trivalent Haar graphs that are vertex Kronecker cover over the dode...
Pure mathematics
- 2018 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
VERTEX and Casual Graphs of Linear Systems
The paper deals with connections between the so-called VERTEX and causal graphs. It is known that a certain class of circuit structures exists whose VERTEX graph can causal graph, when at most one degree o...
JA - Elektronika a optoelektronika, elektrotechnika
- 2001 •
- D
Rok uplatnění
D - Stať ve sborníku
Antimagic Labeling of Generalized Pyramid Graphs
An antimagic labeling of a graph with q edges is a bijection from the set of edges to the set of positive integers {1,2,...,q} such that all vertex weights are pairwise distinct, where the vertex weight of a vertex...
BA - Obecná matematika
- 2014 •
- Jx •
- Link
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Výsledek na webu
A Single-Exponential Fixed-Parameter Algorithm for Distance-Hereditary Vertex Deletion
-exponential fixed-parameter algorithm for vertex deletion to distance-hereditary graphs, a well-studied graph class which is particularly important in the context of vertexVertex deletion problems ask whe...
IN - Informatika
- 2016 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
Flows on the join of two graphs
We prove that the join of two graphs admits a nowhere-zero 3-flow except for a few classes of graphs: a single vertex joined with a graph containing an isolated vertex or an odd circuit tree component, a s...
BA - Obecná matematika
- 2013 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Approximations of permutation-symmetric vertex couplings in quantum graphs
Approximations of interactions at the vertices of quantum graphs.
BE - Teoretická fyzika
- 2006 •
- D
Rok uplatnění
D - Stať ve sborníku
Totally antimagic total graphs
For a graph G, a bijection from the vertex set and the edge set of G to the set. The vertex-weight of a vertex is the sum of the label of the vertex and the labels of all the edges incident with that v...
BA - Obecná matematika
- 2015 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Vertex Couplings in quantum Graphs: Approximations by Scaled Schrödinger Operators
We review recent progress in understanding the physical meaning of quantum graph models through analysis of their vertex coupling approximations....
Pure mathematics
- 2011 •
- D
Rok uplatnění
D - Stať ve sborníku
Vertex labellings of simple graphs
By the book 'Vertex labellings of simple graphs' culminated a seven-year effort of the authors to examine the vertex labellings of graphs via a new method of so-called monograph. The book introduced new concepts of...
BA - Obecná matematika
- 2015 •
- B
Rok uplatnění
B - Odborná kniha
- 1 - 10 out of 8 214