Abstract
A signed relative clique number of signed graph (where edges are assigned positive or negative signs) is the size of a largest subset X of vertices such that every two vertices are either adjacent or are part of a 4-cycle with an odd number of negative edges. The signed relative clique number is sandwiched between two other parameters of signed graphs, namely, the signed absolute clique number and the signed chromatic number, all three notions defined in [R. Naserasr, E. Rollová, and É. Sopena. Homomorphisms of signed graphs. Journal of Graph Theory, 2014]. Thus, together with a result from [P. Ochem, A. Pinlou, and S. Sen. Homomorphisms of signed planar graphs. arXiv preprint arXiv:1401.3308, 2014.], the lower bound of 8 and upper bound of 40 has already been proved for the signed relative clique number of the family of planar graphs. Here we improve the upper bound to 15. Furthermore, we determine the exact values of signed relative clique number of the families of outerplanar graphs and triangle-free planar graphs.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Borodin, O.V.: On the total coloring of planar graphs. J. Reine Angew. Math. 394, 180–185 (1989)
Foucaud, F., Naserasr, R.: The complexity of homomorphisms of signed graphs and signed constraint satisfaction. In: Pardo, A., Viola, A. (eds.) LATIN 2014. LNCS, vol. 8392, pp. 526–537. Springer, Heidelberg (2014)
Harary, F.: On the notion of balance of a signed graph. Mich. Math. J. 2(2), 143–146 (1953)
Klostermeyer, W.F., MacGillivray, G.: Homomorphisms and oriented colorings of equivalence classes of oriented graphs. Discrete Math. 274(1–3), 161–172 (2004)
Naserasr, R., Rollová, E., Sopena, É.: Homomorphisms of planar signed graphs to signed projective cubes. Discrete Math. Theoret. Comput. Sci. 15(3), 1–12 (2013)
Naserasr, R., Rollová, E., Sopena, É.: Homomorphisms of signed bipartite graphs. In: Nešetřil, J., Pellegrini, M. (eds.) The Seventh European Conference on Combinatorics, Graph Theory and Applications, pp. 345–350. Springer, Heidelberg (2013)
Naserasr, R., Rollová, E., Sopena, É.: Homomorphisms of signed graphs. J. Graph Theor. 79(3), 178–212 (2015)
Ochem, P., Pinlou, A., Sen, S.: Homomorphisms of signed planar graphs (2014). arXivpreprint arXiv:1401.3308
Sen, S.: A contribution to the theory of graph homomorphisms and colorings. Ph.D. thesis, University of Bordeaux, France (2014)
Zaslavsky, T.: Signed graphs. Discrete Appl. Math. 4(1), 47–74 (1982)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Das, S., Ghosh, P., Mj, S., Sen, S. (2016). Relative Clique Number of Planar Signed Graphs. In: Govindarajan, S., Maheshwari, A. (eds) Algorithms and Discrete Applied Mathematics. CALDAM 2016. Lecture Notes in Computer Science(), vol 9602. Springer, Cham. https://doi.org/10.1007/978-3-319-29221-2_28
Download citation
DOI: https://doi.org/10.1007/978-3-319-29221-2_28
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-29220-5
Online ISBN: 978-3-319-29221-2
eBook Packages: Computer ScienceComputer Science (R0)