Buscar
Mostrando ítems 1-10 de 2072
UNIVERSALITY OF RANDOM GRAPHS
(SIAM PUBLICATIONSPHILADELPHIA, 2012)
We prove that asymptotically (as n -> infinity) almost all graphs with n vertices and C(d)n(2-1/2d) log(1/d) n edges are universal with respect to the family of all graphs with maximum degree bounded by d. Moreover, we ...
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 ...
Sparse partition universal graphs for graphs of bounded degree
(ACADEMIC PRESS INC ELSEVIER SCIENCE, 2011)
In 1983, Chvatal, Trotter and the two senior authors proved that for any Delta there exists a constant B such that, for any n, any 2-colouring of the edges of the complete graph K(N) with N >= Bn vertices yields a monochromatic ...
Maxclique and unit disk characterizationsof strongly chordal graphs
(University of Zielona Gora, 2014-07)
Maxcliques (maximal complete subgraphs) and unit disks (closed neighborhoods of vertices) sometime play almost interchangeable roles in graph theory. For instance, interchanging them makes two existing characterizations ...
Graph construction based on labeled instances for semi-supervised learning
(International Association of Pattern Recognition - IAPRLinköping UniversityLund UniversityUppsala UniversityInstitute of Electrical and Electronics Engineers - IEEEStockholm, 2014-08)
Semi-Supervised Learning (SSL) techniques have become very relevant since they require a small set of labeled data. In this context, graph-based algorithms have gained prominence in the area due to their capacity to ...
Scaling Theory of the Anderson Transition in Random Graphs: Ergodicity and Universality
(American Physical Society, 2017-04)
We study the Anderson transition on a generic model of random graphs with a tunable branching parameter 1
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 ...
Hamiltonicity of token graphs of fan graphs
(Slovenian Discrete and Applied Mathematics Society and the University of Primorska, FAMNIT., 2018)
In this note we show that the token graphs of fan graphs are Hamiltonian. This result
provides another proof of the Hamiltonicity of Johnson graphs and also extends previous
results obtained by Mirajkar and Priyanka on ...