Results 271 to 280 of about 177,806 (308)

Interlacing eigenvalues and graphs.

Haemers, W.H.
core  

Which graphs are determined by their spectrum?.

Dam, E.R. van, Haemers, W.H.
core  

Codes, graphs and schemes from nonlinear functions.

Dam, E.R. van, Fon-der-Flaass, D.
core  

Graphs with constant mu and mu-bar.

Dam, E.R. van, Haemers, W.H.
core  

ON DISTANCE-$ I $-GRAPHS OF DISTANCE-REGULAR GRAPHS

ON DISTANCE-$ I $-GRAPHS OF DISTANCE-REGULAR GRAPHS
openaire  

Some of the next articles are maybe not open access.

Related searches:

DISTANCE VISIBILITY GRAPHS

International Journal of Computational Geometry & Applications, 1991
A new necessary condition for a graph G to be the visibility graph of a simple polygon is given: each 3-connected component of G must have a vertex ordering in which every vertex is adjacent to a previous 3-clique. This property is used to give an algorithm for the distance visibility graph problem: given an edge-weighted graph G, is it the visibility
Collette R. Coullard, Anna Lubiw
openaire   +1 more source

Distances on a Graph

2020
In this article, our ultimate goal is to transform a graph’s adjacency matrix into a distance matrix. Because cluster density is not observable prior to the actual clustering, our goal is to find a distance whose pairwise minimization will lead to densely connected clusters.
Pierre Miasnikof, Alexander Y. Shestopaloff, Leonidas S. Pitsoulis, Alexander Ponomarenko, Yuri A. Lawryshyn   +4 more
openaire   +1 more source

Distance Graphs on the Integers

Combinatorics, Probability and Computing, 2005
We consider several extremal problems concerning representations of graphs as distance graphs on the integers. Given a graph $G=(V,E)$, we wish to find an injective function $\phi:V\to{\mathbb Z}^+=\{1,2,\dots\}$ and a set ${\mathcal D}\subset{\mathbb Z}^+$ such that $\{u,v\}\in E$ if and only if $|\phi(u)-\phi(v)|\in{\mathcal D}$. Let $s(n)$ be the
Mike Ferrara, Yoshiharu Kohayakawa, Vojtech Rödl   +2 more
openaire   +2 more sources