GlobalView

Add to Quick Collection All 13 Results

Add All Items to Quick Collection

**Date:** 2009
**Language:** eng
**Resource Type:** journal article
**Identifier:** http://hdl.handle.net/1959.13/808876
**Description:** In this paper, we are studying vertex-magic total labelings of simple graphs. We introduce a procedure called mutation which transforms one labeling into another by swapping sets of edges among vertic... More
**Full Text:**
**Reviewed:**
**Date:** 2016
**Language:** eng
**Resource Type:** journal article
**Identifier:** http://hdl.handle.net/1959.13/1331882
**Description:** Let D(n) be the maximal determinant for n × n {±1}-matrices, and R(n) = D(n)/n^{n/2} be the ratio of D(n) to the Hadamard upper bound. Using the probabilistic method, we prove new lower bounds... More
**Full Text:**
**Reviewed:**
**Date:** 2006
**Language:** eng
**Resource Type:** journal article
**Identifier:** http://hdl.handle.net/1959.13/939437
**Description:** We consider the optimization problem defined on a connected undirected graph with given root vertex and a parameter s̅, in which we seek a spanning tree with the smallest number of special (amplifying... More
**Full Text:**
**Reviewed:**
**Date:** 2017
**Language:** eng
**Resource Type:** journal article
**Identifier:** http://hdl.handle.net/1959.13/1349652
**Description:** For a graph *G* we define *k*-labeling *ρ* such that the edges of *G* are labeled with integers {1, 2, . . . , *k*_{e}} and the vertices of *G* are labeled with e... More
**Full Text:**
**Reviewed:**
**Date:** 2010
**Language:** eng
**Resource Type:** journal article
**Identifier:** http://hdl.handle.net/1959.13/931981
**Description:** In this paper, we are studying vertex-magic total labelings (VMTLs) of simple graphs. By now much is known about methods for constructing VMTLs for regular graphs. Here we are studying non-regular gra... More
**Reviewed:**
**Date:** 2011
**Keyword:** vertex magicness | vertex antimagicness | regular circulant graphs | arithmetic progression
**Language:** eng
**Resource Type:** journal article
**Identifier:** http://hdl.handle.net/1959.13/1062612
**Description:** Let G = (V,E) be a graph of order n and size e. An (a, d)-vertexantimagic total labeling is a bijection α from V (G) ∪ E(G) onto the set of consecutive integers {1, 2,..., n + e}, such that the vertex... More
**Full Text:**
**Reviewed:**
**Date:** 2016
**Language:** eng
**Resource Type:** journal article
**Identifier:** http://hdl.handle.net/1959.13/1320273
**Description:** Let n ≥ 3 be a natural number. We study the problem of finding the smallest r such that there is a family Α of 2-subsets and 3-subsets of [n] = {1, 2,...,n} with the following properties: (1) Α is an ... More
**Full Text:**
**Reviewed:**
**Date:** 2002
**Keyword:** triangle-saturated graphs | primitive minimally saturated extensions | triangle-free graphs | vertex addition
**Resource Type:** journal article
**Identifier:** uon:1417
**Description:** A graph G is triangle-saturated if every possible edge addition to G creates one or more new triangles (3-cycles). Such a graph is minimally triangle-saturated if removal of any edge from G leaves a g... More
**Full Text:**
**Reviewed:**
**Date:** 2011
**Language:** eng
**Resource Type:** journal article
**Identifier:** http://hdl.handle.net/1959.13/920376
**Description:** This paper deals with vertex-magic total labellings of graphs. Earlier work by many authors has shown many infinite families of graphs to admit such labelings. The fact that many of these graphs are r... More
**Full Text:**
**Reviewed:**
**Date:** 2012
**Language:** eng
**Resource Type:** journal article
**Identifier:** http://hdl.handle.net/1959.13/1308080
**Description:** An edge labeling of a graph *G* = (*V,E*) is a bijection from the set of edges to the set of integers {1, 2,..., ∣E∣}. The *weight* of a vertex *v* is the sum of the labels of all ... More
**Reviewed:**
**Date:** 2008
**Language:** eng
**Resource Type:** journal article
**Identifier:** http://hdl.handle.net/1959.13/39742
**Description:** Let G be a graph of order p and size q. An (a, d)-edge-antimagic total labeling of G is a one-to-one map f taking the vertices and edges onto 1, 2, . . . , p + q so that the edge-weights w(u, v) = f(u... More
**Full Text:**
**Reviewed:**
**Date:** 2012
**Language:** eng
**Resource Type:** journal article
**Identifier:** http://hdl.handle.net/1959.13/1308077
**Description:** An (*a, d*)-edge-antimagic total labeling of a graph *G* with *p* vertices and *q* edges is a bijection *f* from the set of all vertices and edges to the set of positive integ... More
**Reviewed:**
**Creators:**
Bača, Martin | Miller, Mirka | Phanalasy, Oudone | Ryan, Joe | Semaničová-Feňovčíková, Andrea | Sillasen, Anita Abildgaard
**Date:** 2015
**Language:** eng
**Resource Type:** journal article
**Identifier:** http://hdl.handle.net/1959.13/1332998
**Description:** For a graph G a bijection from the vertex set and the edge set of G to the set {1, 2, ..., |V(G)| + |E(G)|} is called a total labeling of G. The edge-weight of an edge is the sum of the label of the e... More
**Full Text:**
**Reviewed:**