2021
DOI: 10.48550/arxiv.2106.06827
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

On some extremal position problems for graphs

Abstract: 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 place of 'geodesic'. In this paper we investigate some extremal problems for these parameters. Firstly we discuss the problem of the smallest possible order of a graph with given general and monophonic position numbers, with applications to a realisation result. We then so… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 15 publications
0
1
0
Order By: Relevance
“…A simple example is presented in Fig. 6(the graph was originally presented in a different context in Tuite et al 2022).…”
Section: Final Remarksmentioning
confidence: 99%
“…A simple example is presented in Fig. 6(the graph was originally presented in a different context in Tuite et al 2022).…”
Section: Final Remarksmentioning
confidence: 99%