Results 31 to 40 of about 73 (73)
Some News about the Independence Number of a Graph [PDF]
, 2000 For a finite undirected graph G on n vertices some continuous optimization problems taken over the n-dimensional cube are presented and it is proved that their optimum values equal the independence number of G. Keywords: graph, independence.
Harant, Jochen, Jochen Harant
core +1 more source
The spectral even cycle problem [PDF]
In this paper, we study the maximum adjacency spectral radii of graphs of large order that do not contain an even cycle of given length. For \(n›k\), let \(S_{n,k}\) be the join of a clique on \(k\) vertices with an independent set of \(n-k\) vertices ...
Tait, Michael +2 more
core +1 more source
Transfer distance between partitions
Partition, Distance, Clustering, Transfer graph, Centrality, 03E02, 05A18, 05C12, 05C35, 05D99, 62G15, 62G30,
Lucile Denœud
core +1 more source
, 2001 We present a generic preflow algorithm and several implementations of it, that solve the minimum flow problem in O(n2m) time.
Eleonor Ciurea, Laura Ciupal
core
On the diameters of friends-and-strangers graphs [PDF]
Given simple graphs \(X\) and \(Y\) on the same number of vertices, the friends-and-strangers graph \(\operatorname{FS}(X, Y)\) has as its vertices all bijections from \(V(X)\) to \(V(Y)\), where two bijections are adjacent if and only if they differ on ...
Jeong, Ryan
core +1 more source
On Nordhaus-Gaddum type relations of δ-complement graphs. [PDF]
Heliyon, 2023 Vichitkunakorn P +2 more
europepmc +1 more source
Graph with extremal connectivity index
, 2008 . Let G be a graph and δv the degree of its vertex v. The connectivity index of G is χ = (δu δv) −1/2, with the summation ranging over all pairs of adjacent vertices of G.
Ljiljana Pavlović, Ivan Gutman
core
Conflict-free coloring of graphs
, 2013 We study the conflict-free chromatic number χCF of graphs from ex-tremal and probabilistic point of view. We resolve a question of Pach and Tardos about the maximum conflict-free chromatic number an n-vertex graph can have. Our construction is randomized.
Tibor Szabó +2 more
core
Quasirandom Graphs and the Pantograph Equation. [PDF]
Am Math Mon, 2021 Shapira A, Tyomkyn M.
europepmc +1 more source
Kolmogorov Random Graphs And The Incompressibility Method
, 1997 . We investigate topological, combinatorial, statistical, and enumeration properties of finite graphs with high Kolmogorov complexity (almost all graphs) using the novel incompressibility method.
John Tromp +3 more
core