TARU PUBLICATIONS
Journal of Information and Optimization Sciences cover

Journal of Information and Optimization Sciences

(Since 1980)
Open Access ¡Peer-reviewed¡ISSN (Online): 2169-0103¡ISSN (Print): 0252-2667

WoS  JIF 2026 : 0.4 (Q4)

Powered by:Powered by

Monthly Journal: Publishes theoretical and applied research on topics in information and optimization sciences.

Issues up to 2022 co-published with and available at:Taylor & Francis
submissions@tarupublications.com
Taru Online First Current IssueSpecial IssuesBrowse all Issues
Journal of Information and Optimization Sciences
Open Access Research Article

On directed signed cordial labeling

, *

* Corresponding author · click or hover a name for details

pp. 1335–1343Vol. 47Issue 4April 2026DOI: 10.47974/JIOS-2173XML
Received:
01 Nov 2025
Published Online:
04 Apr 2026
Article type:
Research Article
Language:
EN
Article no.:
JIOS-2173
Pages:
1335–1343

Abstract

A measurable collection of dots and a collection of ordered pairings of different dots make up a directed graph, commonly known as a digraph 𝒟.  Each (u,v) pair  is denoted by uv where u is the arc’s beginning dot and v its terminal dot, is an arc. A digraph having V dots and A arcs is called D(V, A). For each vertex v ∈ V, the indegree d –(v) of v indicates how many arcs have v as their terminal dot and the out degree d+(v) of v indicates how many arcs have v indicates how many arcs have v as their starting dot.  In this article, we explored the presence of di-signed cordiality for certain families of digraphs and defined a new style of labeling known as directed signed cordial labeling (DSCL), also known as di-signed cordial labeling. 

Keywords

Di-graphDi triangular snakeDi helmDi closed helm

Subject Classifications

05C78

References

[1] A. Rosa, “On certain valuations of the vertices of a graph”, Theory of Graphs (Internat. Symposium, Rome, July 1966), Gordon and Breach, N. Y. and Dunod Paris, pp. 349-355 (1967).
[2] M. Baca and M. Miller, “Cordial labeling of graphs: A survey,” J. Discrete Math. Sci. Cryptogr., vol. 10, no. 1, pp. 1–23 (2007).
[3] S. M. Hedge and S. Shetty, “On magic graphs”, Australasian J. Combinatorics, vol. 27 , pp. 277-284 (2003).
[4] I. Cahit, “Cordial Graphs: A weaker version of graceful and Harmonic Graphs”, Ars Combinatoria, pp. 201-207 (1987).
[5] Jayapal Baskar Babujee and Shobana Loganathan, “On Signed Product Cordial Labeling”, Scientific Research Journal on Applied Mathematics, vol. 2, pp. 1525-1530 (2011).
[6] J. Devaraj and P. Prem Delphy, “On Signed Cordial Graph”, International Journal of Mathematical sciences and application, vol. 1, (2011).
[7] J. A. Gallian, “A dynamic survey of graph labeling”, The Electronics Journal of Combinatorics, vol. 17, DS6 (2021).
[8] R. Ponraj and J. B. Babujee, “Cordial and signed cordial labeling of graphs”, J.  Discrete Math. Sci. Cryptogr., vol. 12, no. 2, pp. 149–160 (2009).
[9] G. S. Bloom and S. W Golomb, “Applications of numbered undirected graphs”, Proceedings of IEEE, pp. 562-570, (1977).
[10] K. Thirusangu and M. Anitha, “Signed cordial labeling of some graph families,” J. Discrete Math. Sci. Cryptogr.,  vol. 15, no. 1, pp. 75–84 (2012).
[11] M. Santhi and James Albert, “Signed Product cordial in Cycle Related graphs”, International Journal of Mathematics and Computer Application Research, vol. 5, pp. 29-36 (2016).
[12] S. Arockiaraj and P. Jeyanthi, “Product cordial labeling of graphs,” J. Discrete Math. Sci. Cryptogr., vol. 14, no. 4, pp. 325–334 (2011).
[13] G. H. Yang, Q. D. Kang, Z. H. Liang, and Y. Z. Gao, “On the labeling of some graphs”, J. Combin. Math. Combin. Comput., vol. 22, pp.193-210 (1996).

Views: 75Downloads: 13Citations: 0