Characterization of classes of graphs with large general position number
| Autor: | Elias John Thomas, S V Ullas Chandran |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2020 |
| Předmět: |
lcsh:Mathematics
010102 general mathematics Discrete geometry Graph theory 0102 computer and information sciences Girth (graph theory) Characterization (mathematics) lcsh:QA1-939 01 natural sciences Combinatorics Set (abstract data type) girth 05C15 general position set 010201 computation theory & mathematics general position number FOS: Mathematics Mathematics - Combinatorics Discrete Mathematics and Combinatorics Combinatorics (math.CO) 0101 mathematics diameter General position Selection (genetic algorithm) Mathematics |
| Zdroj: | AKCE International Journal of Graphs and Combinatorics, Vol 17, Iss 3, Pp 935-939 (2020) |
| ISSN: | 2543-3474 0972-8600 |
| Popis: | 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 if no element of $S$ lies on a geodesic between any two other elements of $S$. The cardinality of a largest general position set is the general position number ${\rm gp}(G)$ of $G.$ In \cite{ullas-2016} graphs $G$ of order $n$ with ${\rm gp}(G)$ $\in \{2, n, n-1\}$ were characterized. In this paper, we characterize the classes of all connected graphs of order $n\geq 4$ with the general position number $n-2.$ |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|