Article
On signed product cordial of lemniscate graph and its second power
Authors
, and
Abstract
A graph is called signed product cordial graph if it is possible to label the vertex by the function and label the edges by , where , so that and . In this paper we present necessary and sufficient conditions for which lemniscate and its second power are signed product cordial graph.
Keywords
lemniscate, path, second power, signed cordial graph, graph
Citation
Nada, S., Elrokh, A., & Abd El-Hay, A. (2022). On signed product cordial of lemniscate graph and its second power. Turkish Journal of Computer and Mathematics Education, 13(3), 905–913.
S. Nada, A. Elrokh and A. Abd El-Hay, “On signed product cordial of lemniscate graph and its second power,” Turkish Journal of Computer and Mathematics Education, vol. 13, no. 3, pp. 905–913, 2022.
Nada S, Elrokh A, Abd El-Hay A. On signed product cordial of lemniscate graph and its second power. Turkish Journal of Computer and Mathematics Education. 2022;13(3):905–913.
Nada, S., Elrokh, A. and Abd El-Hay, A. (2022), ‘On signed product cordial of lemniscate graph and its second power’, Turkish Journal of Computer and Mathematics Education, 13(3), pp. 905–913.
Nada, Shokry, et al. “On Signed Product Cordial of Lemniscate Graph and Its Second Power.” Turkish Journal of Computer and Mathematics Education, vol. 13, no. 3, 2022, pp. 905–913.
Nada, Shokry, Ashraf Elrokh, and Atef Abd El-Hay. “On Signed Product Cordial of Lemniscate Graph and Its Second Power.” Turkish Journal of Computer and Mathematics Education 13, no. 3 (2022): 905–913.
Export citation
Published by: Engineering Journals
