Skip to main content Accessibility help
×
Home
Hostname: page-component-78bd46657c-gwmzn Total loading time: 0.251 Render date: 2021-05-08T10:39:14.364Z Has data issue: true Feature Flags: { "shouldUseShareProductTool": true, "shouldUseHypothesis": true, "isUnsiloEnabled": true, "metricsAbstractViews": false, "figures": false, "newCiteModal": false, "newCitedByModal": true }

THE GENERAL POSITION NUMBER OF THE CARTESIAN PRODUCT OF TWO TREES

Published online by Cambridge University Press:  04 December 2020

JING TIAN
Affiliation:
College of Science, Nanjing University of Aeronautics and Astronautics, Nanjing, Jiangsu 210016, PR China e-mail: jingtian526@126.com
KEXIANG XU
Affiliation:
College of Science, Nanjing University of Aeronautics and Astronautics, Nanjing, Jiangsu 210016, PR China
SANDI KLAVŽAR
Affiliation:
Faculty of Mathematics and Physics, University of Ljubljana, Slovenia; Faculty of Natural Sciences and Mathematics, University of Maribor, Slovenia and Institute of Mathematics, Physics and Mechanics, Ljubljana, Slovenia e-mail: sandi.klavzar@fmf.uni-lj.si

Abstract

The general position number of a connected graph is the cardinality of a largest set of vertices such that no three pairwise-distinct vertices from the set lie on a common shortest path. In this paper it is proved that the general position number is additive on the Cartesian product of two trees.

Type
Research Article
Copyright
© 2020 Australian Mathematical Publishing Association Inc.

Access options

Get access to the full version of this content by using one of the access options below.

Footnotes

Kexiang Xu is supported by NNSF of China (grant no. 11671202 and the China–Slovene bilateral grant 12-9). Sandi Klavžar acknowledges financial support from the Slovenian Research Agency (research core funding P1-0297, projects J1-9109, J1-1693, N1-0095 and the bilateral grant BI-CN-18-20-008).

References

Anand, B. S., Ullas Chandran, S. V., Changat, M., Klavžar, S. and Thomas, E. J., ‘Characterization of general position sets and its applications to cographs and bipartite graphs’, Appl. Math. Comput. 359 (2019), 8489.Google Scholar
Balakrishnan, R., Raj, S. F. and Kavaskar, T., ‘ $b$ -coloring of Cartesian product of trees’, Taiwanese J. Math. 20 (2016), 111.Google Scholar
Ghorbani, M., Klavžar, S., Maimani, H. R., Momeni, M., Rahimi-Mahid, F. and Rus, G., ‘The general position problem on Kneser graphs and on some graph operations’, Discuss. Math. Graph Theory, to appear. Published online (24 January 2020).CrossRefGoogle Scholar
Imrich, W., Klavžar, S. and Rall, D. F., Topics in Graph Theory: Graphs and their Cartesian Product (A. K. Peters, Wellesley, MA, 2008).CrossRefGoogle Scholar
Klavžar, S., Patkós, B., Rus, G. and Yero, I. G., ‘On general position sets in Cartesian grids’, Preprint, 2019, arXiv:1907.04535 [math.CO].Google Scholar
Klavžar, S. and Rus, G., ‘The general position number of integer lattices’, Appl. Math. Comput. 390 (2021), Article ID 125664.Google Scholar
Klavžar, S. and Yero, I. G., ‘The general position problem and strong resolving graphs’, Open Math. J. 17 (2019), 11261135.CrossRefGoogle Scholar
Körner, J., ‘On the extremal combinatorics of the Hamming space’, J. Combin. Theory Ser. A 71 (1995), 112126.CrossRefGoogle Scholar
Manuel, P. and Klavžar, S., ‘A general position problem in graph theory’, Bull. Aust. Math. Soc. 98 (2018), 177187.Google Scholar
Manuel, P. and Klavžar, S., ‘The graph theory general position problem on some interconnection networks’, Fund. Inform. 163 (2018), 339350.Google Scholar
Patkós, B., ‘On the general position problem on Kneser graphs’, Ars Math. Contemp., to appear.Google Scholar
Shiu, W. C. and Low, R. M., ‘The integer-magic spectra and null sets of the Cartesian product of trees’, Australas. J. Combin. 70 (2018), 157167.Google Scholar
Tian, J. and Xu, K., ‘The general position number of Cartesian products of trees or cycles with general graphs’, Preprint, 2020.Google Scholar
Ullas Chandran, S. V. and Jaya Parthasarathy, G., ‘The geodesic irredundant sets in graphs’, Int. J. Math. Combin. 4 (2016), 135143.Google Scholar
Wood, D. R., ‘Colouring the square of the Cartesian product of trees’, Discrete Math. Theor. Comput. Sci. 13 (2011), 109111.Google Scholar

Send article to Kindle

To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

THE GENERAL POSITION NUMBER OF THE CARTESIAN PRODUCT OF TWO TREES
Available formats
×

Send article to Dropbox

To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

THE GENERAL POSITION NUMBER OF THE CARTESIAN PRODUCT OF TWO TREES
Available formats
×

Send article to Google Drive

To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

THE GENERAL POSITION NUMBER OF THE CARTESIAN PRODUCT OF TWO TREES
Available formats
×
×

Reply to: Submit a response


Your details


Conflicting interests

Do you have any conflicting interests? *