Results 31 to 40 of about 4,935,854 (284)
Plick Graphs with Crossing Number 1 [PDF]
In this paper, we deduce a necessary and sufficient condition for graphs whose plick graphs have crossing number 1. We also obtain a necessary and sufficient condition for plick graphs to have crossing number 1 in terms of forbidden ...
Basavanagoud, B., Kulli, V.R.
core +1 more source
The General Position Problem on Kneser Graphs and on Some Graph Operations
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
The n-th Power Signed Graphs-II [PDF]
For standard terminology and notion in graph theory we refer the reader to Harary [6]; the non-standard will be given in this paper as and when required.
Reddyy, P. Siva Kota +2 more
core +1 more source
Smarandachely t-path step signed graphs [PDF]
Characterizing signed graphs which are switching equivalent to their Smarandachely 3-path step signed ...
Reddy, Siva Kota +5 more
core +1 more source
Negation Switching Equivalence in Signed Graphs [PDF]
Unless mentioned or defined otherwise, for all terminology and notion in graph theory the reader is refer to [8].
Reddy, Siva Kota
core +1 more source
Constructing sonified haptic line graphs for the blind student: first steps [PDF]
Line graphs stand as an established information visualisation and analysis technique taught at various levels of difficulty according to standard Mathematics curricula.
Riedel, B. +11 more
core +1 more source
Some Properties of Regular Line Graphs
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
Old and new generalizations of line graphs
Line graphs have been studied for over seventy years. In 1932, H. Whitney showed that for connected graphs, edge-isomorphism implies isomorphism except for K3 and K1,3.
Jay Bagga
doaj +1 more source
Aligned Drawings of Planar Graphs
Let $G$ be a graph that is topologically embedded in the plane and let $\mathcal A$ be an arrangement of pseudolines intersecting the drawing of $G$.
Tamara Mchedlidze +2 more
doaj +1 more source
B0-VPG Representation of AT-free Outerplanar Graphs
A $k$-bend path is a non-self-intersecting polyline in the plane made of at most $k+1$ axis-parallel line segments. B$_{k}$-VPG is the class of graphs which can be represented as intersection graphs of $k$-bend paths in the same plane. In this paper,
Sparsh Jain +2 more
doaj +1 more source

