Now showing items 1-6 of 6

• #### FORCING LARGE COMPLETE (TOPOLOGICAL) MINORS IN INFINITE GRAPHS∗ ﻿

(Society for Industrial and Applied Mathematics, 2013)
It is well known that in finite graphs, large complete minors/topological minors can be forced by assuming a large average degree. Our aim is to extend this fact to infinite graphs. For this, we generalize the notion of ...
• #### Graphs admitting antimagic labeling for arbitrary sets of positive integers ﻿

(Elsevier, 2017)
A connected graph G=(V,E) with m edges is called universal antimagic if for each set B of m positive integers there is an bijective function f:E→B such that the function f˜:V→N defined at each vertex v as the sum of all ...
• #### Graphs admitting antimagic labeling for arbitrary sets of positive numbers ﻿

(Elsevier, 2020)
Hartsfield and Ringel in 1990 conjectured that any connected graph with q >= 2 edges has an edge labeling f with labels in the set {1,..., q}, such that for every two distinct vertices u and v, f(u) not equal= f(v), where ...
• #### Lines in bipartite graphs and in 2-metric spaces ﻿

(Wiley, 2020)
The line generated by two distinct points, x and y, in a finite metric space M=(V,d), is the set of points given by {z is an element of V:d(x,y)=|d(x,z)+d(z,y)|ord(x,y)=|d(x,z)-d(z,y)|}. It is denoted by xy over bar M. A ...
• #### A new family of expansive graphs ﻿

(ELSEVIER SCIENCE BV, 2008-04-01)
An affine graph is a pair (G, ) where G is a graph and is an automorphism assigning to each vertex of G one of its neighbors. On one hand, we obtain a structural decomposition of any affine graph (G, ) in terms of the ...
• #### Weighted antimagic labeling ﻿

(Elsevier, 2018-08)
A graph G = (V, E) is weighted-k-antimagic if for each w : V -> R, there is an injective function f : E -> {1,...,vertical bar E vertical bar + k} such that the following sums are all distinct: for each vertex u, Sigma(v:uv ...