On the general position number of Mycielskian graphs
Authors: 
Elias John Thomas, Ullas Chandran S.V., James Tuite, Gabriele Di StefanoAuthors Info & Claims
References
[1]
Abid A.M., Rao T.R., Dominator coloring of mycielskian graphs, Australas. J. Combin. 73 (2019) 274–279.
[2]
Anand B.S., Chandran S.V. U., Changat M., Klavžar S., Thomas E.J., Characterization of general position sets and its applications to cographs and bipartite graphs, Appl. Math. Comput. 359 (2019) 84–89.
[3]
Araujo J., Dourado M.C., Protti F., Sampaio R., The general position number and the iteration time in the P 3 convexity, 2023, arXiv preprint arXiv:2305.00467.
[4]
Balakrishnan R., Kavaskar T., So W., The energy of the Mycielskian of a regular graph, Australas. J. Combin. 52 (2012) 163–172.
[5]
Balakrishnan R., Raj S.F., Connectivity of the mycielskian of a graph, Discrete Math. 308 (12) (2008) 2607–2610.
[6]
Bondy J.A., Murty U.S.R., Graph Theory with Applications, Macmillan, London, 1976.
[7]
Chandran S.V. U., Parthasarathy G.J., The geodesic irredundant sets in graphs, Int. J. Math. Comb. 4 (2016).
[8]
Di Stefano G., Mutual visibility in graphs, Appl. Math. Comput. 419 (2022).
[9]
Di Stefano G., Klavžar S., Krishnakumar A., Tuite J., Yero I.G., Lower general position sets in graphs, Discuss. Math. Graph Theory (2023) in Press, arXiv preprint arXiv:2306.09965.
[10]
Dliou K., Boujaoui H.E., Kchikech M., The L ( 2, 1 )-labeling of the iterated Mycielski graphs of graphs and some problems related to matching problems, Discuss. Math. Graph Theory 44 (2) (2024) 489–518.
[11]
Dudeney H.E., Amusements in Mathematics, 1917, Nelson, Edinburgh.
[12]
Fan G.H., Circular chromatic number and mycielskian graphs, Combinatorica 24 (1) (2004) 127–135.
[13]
Froese V., Kanj I., Nichterlein A., Niedermeier R., Finding points in general position, Internat. J. Comput. Geom. Appl. 27 (04) (2017) 277–296.
[14]
Granados A., Pestana D., Portilla A., Rodríguez J.M., Gromov hyperbolicity in mycielskian graphs, Symmetry 9 (8) (2017) 131.
[15]
Klavžar S., Krishnakumar A., Tuite J., Yero I.G., Traversing a graph in general position, Bull. Aust. Math. Soc. (2023) 1–13.
[16]
Klavžar S., Kuziak D., Peterin I., Yero I.G., A steiner general position problem in graph theory, Comput. Appl. Math. 40 (2021) 1–15.
[17]
Klavžar S., Rall D.F., Yero I.G., General d-position sets, Ars Math. Contemp. 21 (2021) Paper P1.03.
[18]
Klavžar S., Tan E., Edge general position sets in fibonacci and lucas cubes, Bull. Malaysian Math. Sci. Soc. 46 (4) (2023) 120.
[19]
Korže D., Vesel A., General position sets in two families of cartesian product graphs, Mediterr. J. Math. 20 (4) (2023) 203.
[20]
Manuel P., Klavžar S., A general position problem in graph theory, Bull. Aust. Math. Soc. 98 (2) (2018) 177–187.
[21]
Manuel P., Prabha R., Klavžar S., The edge general position problem, Bull. Malays. Math. Sci. Soc. 45 (2022) 2997–3009.
[22]
Mycielski J., Sur le coloriage des graphes, Colloq. Math. 3 (1955) 9.
[23]
Payne M.S., Wood D.R., On the general position subset selection problem, SIAM J. Discrete Math. 27 (4) (2013) 1727–1733.
[24]
Prabha R., Devi S.Renukaa., Manuel P., General position problem of butterfly networks, 2023, arXiv preprint arXiv:2302.06154.
[25]
Savitha K.S., Vijayakumar A., Some network topological notions of the mycielskian of a graph, AKCE Int. J. Graphs Comb. 13 (1) (2016) 31–37.
[26]
Thankachy M., Chandran S.V. U., Tuite J., Thomas E.J., Stefano G.Di., Erskine G., On the vertex position number of graphs, Discuss. Math. Graph Theory (2023) in Press, arXiv preprint arXiv:2209.00359.
[27]
Thomas E.J., Chandran S.V. U., On independent position sets in graphs, Proyecciones (Antofagasta) 40 (2) (2021) 385–398.
[28]
Thomas E.J., Chandran S.V. U., Tuite J., Di Stefano G., On monophonic position sets in graphs, Discr. Appl. Math. (2023),.
[29]
Tian J., Klavžar S., Tan E., Extremal edge general position sets in some graphs, Graphs Comb. 40 (40) (2024) arXiv preprint arXiv:2302.01587.
[30]
Varghese J., Lakshmanan S.A., Italian domination on Mycielskian and Sierpinski graphs, Discrete Math. Algorithms Appl. (2020).
Recommendations
On monophonic position sets in graphs
AbstractThe 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 the ...
The general position number of Cartesian products involving a factor with small diameter
Highlights- The gp-number is determined for the Cartesian product of a tree and a complete graph.
AbstractA vertex subset R of a graph G is called a general position set if any triple V 0 ⊆ R is non-geodesic, this is, the three elements of V 0 do not lie on the same geodesic in G. The general position number (gp-number for short) g p ( G ) ...
Characterization of general position sets and its applications to cographs and bipartite graphs
AbstractA 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(G) of G. It is ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
The Author(s).
Publisher
Elsevier Science Publishers B. V.
Netherlands
Publication History
Published: 18 July 2024
Author Tags
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 26 Nov 2024
Other Metrics
Citations
View Options
View options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in