Results 21 to 30 of about 137,342 (261)

Tight bounds for intersection‐reverse sequences, edge‐ordered graphs, and applications

Journal of the London Mathematical Society
Abstract In 2006, Marcus and Tardos proved that if are cyclic orders on some subsets of a set of symbols such that the common elements of any two distinct orders and appear in reversed cyclic order in and , then .
Barnabás Janzer, Oliver Janzer, Abhishek Methuku, Gábor Tardos   +3 more
  +6 more sources

Segmentation and Multimodal Characterization of Metal Particles in the Human Hippocampus Using Discrete Segmentation Algorithms and Correlation Spectral Analysis [PDF]

Molecules
The accumulation of metallic micro- and nanoparticles in the human hippocampus is increasingly linked to neurotoxic processes and neurodegenerative disorders.
Ján Pánik, Mária Ždímalová, Daniel Kosnáč, Martin Kopáni, Silvia Dulanská, Nazarii Kretsul, Michal Trnka   +6 more
doaj   +2 more sources

The edge intersection graphs of paths in a tree

Journal of Combinatorial Theory, Series B, 1985
We investigate the class of edge intersection graphs of a collection of paths in a tree (EPT graphs) where two paths edge intersect if they share an edge. The cliques of an EPT graph are characterized and shown to have strong Helly number 4. From this we demonstrate that one can find a maximum clique of an EPT graph in polynomial time. We show that the
Golumbic, Martin Charles, Jamison, Robert E   +1 more
openaire   +4 more sources

Edge-intersection graphs of grid paths: The bend-number

Discrete Applied Mathematics, 2013
33 pages, 20 ...
Daniel Heldt, Kolja Knauer, Torsten Ueckerdt   +2 more
openalex   +4 more sources

Characterization and recognition of edge intersection graphs of trichromatic hypergraphs with finite multiplicity in the class of split graphs

Informatika, 2018
A hypergraph is called k-chromatic if its vertex set can be partitioned into at most k pairwise disjoint subsets when each subset has no more than two common vertices with every edge of the hypergraph.
T. V. Lubasheva
doaj   +1 more source

Normal approximation for number of edges in random intersection graphs [PDF]

44 pages, 5 ...
Katarzyna Rybarczyk, Grzegorz Serafin
openalex   +3 more sources

On local edge intersection graphs of paths on bounded degree trees

Matemática Contemporânea, 2015
An undirected graph G is called an EPT graph if it is the edge intersection graph of a family of paths in a tree. We call G a local EPT graph if it is the EPT graph of a collection of paths P which all share a common vertex. In this paper, we characterize the local EPT graphs which can be represented in a host tree with maximum degree h.
Liliana Alcón, Marisa Gutiérrez, María Pía Mazzoleni   +2 more
openalex   +3 more sources

Edge intersection graphs of linear 3-uniform hypergraphs

Electronic Notes in Discrete Mathematics, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pavel Skums, S.V. Suzdal, R. I. Tyshkevich   +2 more
openalex   +3 more sources

Characterization and recognition of edge intersection graphs of 3-chromatic hypergraphs with multiplicity at most than two in the class of split graphs

Журнал Белорусского государственного университета: Математика, информатика, 2018
Let Lm(k) denote the class of edge intersection graphs of k-chromatic hypergraphs with multiplicity at most m. It is known that the problem of recognizing graphs from L1(k) is polynomially solvable if k = 2 and is NP-complete if k = 3.
Tatiana V. Lubasheva, Yury M. Metelsky
doaj   +1 more source

Number of Edges in Random Intersection Graph on Surface of a Sphere [PDF]

, 2008
In this article, we consider `$N$'spherical caps of area $4 p$ were uniformly distributed over the surface of a unit sphere. We study the random intersection graph $G_N$ constructed by these caps. We prove that for $p = \frac{c}{N^{\al}},\:c >0$ and $\al >2,$ the number of edges in graph $G_N$ follow the Poisson distribution.
Bhupendra Gupta
openalex   +3 more sources