Results 31 to 40 of about 137,342 (261)
On Non-Superperfection of Edge Intersection Graphs of Paths
, 2023 Annegret K. Wagler, Hervé Kerivin
openalex +2 more sources
Representing edge intersection graphs of paths on degree 4 trees
Discrete Mathematics, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Martin Charles Golumbic +2 more
openalex +2 more sources
On the intersection of edges of a geometric graph by straight lines
Discrete Mathematics, 1986 A geometric graph \((=gg)\) is a pair \(G=\), where V is a finite set of points \((=\) vertices) in general position in the plane and E is a set of open straight line segments \((=\) edges) whose endpoints are in V. For \(S\subseteq R^ 2\), denote by I(G,S) the number of edges of G that intersect S.
Noga Alon, Micha A. Perles
openalex +2 more sources
Graphs defined on groups [PDF]
International Journal of Group Theory, 2022 This paper concerns aspects of various graphs whose vertex set is a group $G$ and whose edges reflect group structure in some way (so that, in particular, they are invariant under the action of the automorphism group of $G$).
Peter J. Cameron
doaj +1 more source
Graphs of edge-intersecting non-splitting paths
Discrete Mathematics & Theoretical Computer Science, 2020 In this work, we introduce and study a new graph class: namely the graphs ofEdge-Intersecting Non-Splitting Paths (ENP). First, we consider a special case wherethe host graph is a tree: the graphs of Edge-Intersecting Non-Splitting Paths in a Tree(ENPT).
Boyacı, Arman +3 more
openaire +6 more sources
Graphs of Edge-Intersecting and Non-Splitting One Bend Paths in a Grid [PDF]
Discrete Mathematics & Theoretical Computer Science, 2017 The families EPT (resp. EPG) Edge Intersection Graphs of Paths in a tree (resp. in a grid) are well studied graph classes. Recently we introduced the graph classes Edge-Intersecting and Non-Splitting Paths in a Tree ENPT, and in a Grid (ENPG).
Arman Boyacı +3 more
doaj +1 more source
Independent point-set domination in line graphs
AKCE International Journal of Graphs and Combinatorics, 2021 Line graph of a graph G is an intersection graph of the edge set E(G) of G. In this paper, we obtain a sharp upper bound on the diameter of graph G whose line graph is an ipsd graph (graph possessing an independent point-set dominating set) by ...
Purnima Gupta, Alka Goyal, Ranjana Jain
doaj +1 more source
On graphs with equal coprime index and clique number
AKCE International Journal of Graphs and Combinatorics, 2023 Recently, Katre et al. introduced the concept of the coprime index of a graph. They asked to characterize the graphs for which the coprime index is the same as the clique number. In this paper, we partially solve this problem.
Chetan Patil +2 more
doaj +1 more source
Information, 2022 We study classes of geometric graphs, which all correspond to the following structural characteristic. For each instance of a vertex set drawn from a universe of possible vertices, each pair of vertices is either required to be connected, forbidden to be
Lucas Böltz, Hannes Frey
doaj +1 more source
The super-connectivity of Johnson graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 For positive integers $n,k$ and $t$, the uniform subset graph $G(n, k, t)$ has all $k$-subsets of $\{1,2,\ldots, n\}$ as vertices and two $k$-subsets are joined by an edge if they intersect at exactly $t$ elements.
Gülnaz Boruzanlı Ekinci +1 more
doaj +1 more source