Zobrazeno 1 - 10
of 102
pro vyhledávání: '"A. V. Ullas"'
In this paper we consider a colouring version of the general position problem. The \emph{$\gp $-chromatic number} is the smallest number of colours needed to colour $V(G)$ such that each colour class has the no-three-in-line property. We determine bo
Externí odkaz:
http://arxiv.org/abs/2408.13494
Publikováno v:
Advances in Polymer Technology, Vol 2019 (2019)
In this paper, we discuss the chemorheology of epoxy based syntactic foams containing glass microballoons of varying density, with an aim of establishing the effect of microballoon loading on its processability. The primary objective is to determine
Externí odkaz:
https://doaj.org/article/427d08ef84a34c8c8ca52d04820eb13e
A set $S$ of vertices of a graph $G$ is \emph{monophonic convex} if $S$ contains all the vertices belonging to any induced path connecting two vertices of $S$. The cardinality of a maximum proper monophonic convex set of $G$ is called the \emph{monop
Externí odkaz:
http://arxiv.org/abs/2208.10215
Given a graph $G$, a set $S$ of vertices in $G$ is a general position set if no triple of vertices from $S$ lie on a common shortest path in $G$. The general position achievement/avoidance game is played on a graph $G$ by players A and B who alternat
Externí odkaz:
http://arxiv.org/abs/2205.03526
A general position set of a graph $G$ is a set of vertices $S$ in $G$ such that no three vertices from $S$ lie on a common shortest path. In this paper we introduce and study the general position achievement game. The game is played on a graph $G$ by
Externí odkaz:
http://arxiv.org/abs/2111.07425
Autor:
THANKACHY, MAYA G. S.1 mayagsthankachy@gmail.com, S. V., ULLAS CHANDRAN1 svuc.math@gmail.com, TUITE, JAMES2 james.t.tuite@open.ac.uk, THOMAS, ELIAS JOHN3 eliasjohnkalarickal@gmail.com, DI STEFANO, GABRIELE4 gabriele.distefano@univaq.it, ERSKINE, GRAHAME2 grahame.erskine@open.ac.uk
Publikováno v:
Discussiones Mathematicae: Graph Theory. 2024, Vol. 44 Issue 3, p1169-1188. 20p.
The general position number of a graph $G$ is the size of the largest set of vertices $S$ such that no geodesic of $G$ contains more than two elements of $S$. The monophonic position number of a graph is defined similarly, but with `induced path' in
Externí odkaz:
http://arxiv.org/abs/2106.06827
Publikováno v:
In Theoretical Computer Science 12 March 2024 988
The general position problem in graph theory asks for the largest set $S$ of vertices of a graph $G$ such that no shortest path of $G$ contains more than two vertices of $S$. In this paper we consider a variant of the general position problem called
Externí odkaz:
http://arxiv.org/abs/2012.10330
Getting inspired by the famous no-three-in-line problem and by the general position subset selection problem from discrete geometry, the same is introduced into graph theory as follows. A set $S$ of vertices in a graph $G$ is a general position set i
Externí odkaz:
http://arxiv.org/abs/2004.04648