Results 21 to 30 of about 1,370,090 (279)
The General Position Problem on Kneser Graphs and on Some Graph Operations
Discussiones Mathematicae Graph Theory, 2021 A vertex subset S of a graph G is a general position set of G if no vertex of S lies on a geodesic between two other vertices of S. The cardinality of a largest general position set of G is the general position number (gp-number) gp(G) of G.
Ghorbani Modjtaba +5 more
doaj +1 more source
On grounded L-graphs and their relatives [PDF]
, 2018 We consider the graph class Grounded-L corresponding to graphs that admit an intersection representation by L-shaped curves, where additionally the topmost points of each curve are assumed to belong to a common horizontal line.
Jelínek, Vít, Töpfer, Martin
core +3 more sources
Tight Frame Graphs Arising as Line Graphs
The PUMP Journal of Undergraduate Research, 2021 Dual multiplicity graphs are those simple, undirected graphs that have a weighted Hermitian adjacency matrix with only two distinct eigenvalues. From the point of view of frame theory, their characterization can be restated as which graphs have a representation by a tight frame.
Furst, Veronika, Grotts, Howard
openaire +3 more sources
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
Constructing sonified haptic line graphs for the blind student: first steps [PDF]
, 2000 Line graphs stand as an established information visualisation and analysis technique taught at various levels of difficulty according to standard Mathematics curricula.
Brewster, S. +5 more
core +2 more sources
The Journal of Symbolic LogicAbstract We characterize Borel line graphs in terms of 10 forbidden induced subgraphs, namely the nine finite graphs from the classical result of Beineke together with a 10th infinite graph associated with the equivalence relation $\mathbb {E}_0$ on the Cantor space.
JAMES ANDERSON, ANTON BERNSHTEYN
openaire +2 more sources
Location-domination in line graphs
, 2016 A set $D$ of vertices of a graph $G$ is locating if every two distinct vertices outside $D$ have distinct neighbors in $D$; that is, for distinct vertices $u$ and $v$ outside $D$, $N(u) \cap D \neq N(v) \cap D$, where $N(u)$ denotes the open neighborhood
Foucaud, Florent, Henning, Michael A.
core +3 more sources
Web-based multimodal graphs for visually impaired people [PDF]
, 2002 This paper describes the development and evaluation of Web-based multimodal graphs designed for visually impaired and blind people. The information in the graphs is conveyed to visually impaired people through haptic and audio channels. The motivation of
A Hardwick +13 more
core +3 more sources
Outerplanarity of line graphs and iterated line graphs
Applied Mathematics Letters, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lin, Huiqiu +3 more
openaire +2 more sources
Some Properties of Regular Line Graphs
مجلة علوم ذي قار, 2019 In this paper, the concept of regular line graph has been introduced. The maximum number of vertices with different degrees in the regular line graphs has also been studied.
Akram Attar
doaj +4 more sources