Zumkeller Cordial Labeling of Graphs

Murali, B. J.; Thirusangu, K.; Meenakshi, R.

doi:10.1007/978-981-10-0251-9_49

Cited by 5 publications

(5 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Now, the numbers of the form That is, 6 edges receive the Zumkeller number 3.2 7 , 6 edges receive the Zumkeller number 3.2 9 , the edges e 12,1 and e 4,34 receive the Zumkeller number 3.2 8 . In total 5+5+6+6+2 = 24 edges of P 4 P 4 receive only 5-Zumkellernumbers.…”

Section: Proofmentioning

confidence: 99%

“…The graphs labeled with Zumkeller numbers [13], a recent development in graph labeling, are potential area of research. In [1,2,3,4,9], we have investigated two different graph labeling viz., (i) Zumkeller labeling and (ii) Strongly multiplicative Zumkeller labeling. In [5], we introduced the k-Zumkeller graphs and proved that the twig graphs are 4-Zumkeller graphs.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

k-Zumkeller Labeling of Graphs

Balamurugan¹,

Thirusangu²,

Thomas³

et al. 2018

IJET

Self Cite

View full text Add to dashboard Cite

show abstract

Section: Proofmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

k-Zumkeller Labeling of Graphs

Balamurugan¹,

Thirusangu²,

Thomas³

et al. 2018

IJET

Self Cite

View full text Add to dashboard Cite

show abstract

“…The basic graph notations and terminologies used in molecular graphs are referred to Harary [16] and West [17]. Cordial labeled graphs were introduced by Cahit [18] in 1990 and the biconditional cordial graphs were discussed by B. J. Murali et al, [19]. The Topological indices of labeled molecular graphs were introduced by Princess Rathinabai et al, in the year 2021 [20].…”

Section: Introductionmentioning

confidence: 99%

Topological indices of molecular graphs of monkeypox drugs for QSPR analysis to predict physicochemical and ADMET properties

Kalaimathi,

Balamurugan

2023

Int J of Quantum Chemistry

View full text Add to dashboard Cite

Numerous viral diseases endure to develop causing serious community health issues. One of such diseases is monkeypox, which is a viral zoonotic disease, found primarily in remote areas of Central and West African countries and is sporadically spread to other countries. The virus is transmitted to people through contact with infected animals and also from person to person through respiratory droplets, bodily fluids and skin lesions of infected individuals. There are no specific drugs to treat monkeypox virus. This virus is similar to smallpox and belongs to Orthopoxvirus family. The smallpox drugs are recommended to treat monkeypox disease. There are few antiviral drugs such as Cidofovir, Valacyclovir, Famciclovir, Acyclovir, Tecovirimat, and Brincidofovir used for treating monkeypox disease. A chemical molecule/structure can be considered as a graph where is the set of atoms and is the set of bonds between the atoms. A molecular descriptor of the molecular graph/structure is a numerical value of . The numerical values of molecular descriptors are used to quantitatively describe the physical and chemical information of the molecules. In this article, density based topological descriptors are computed for the molecular graphs of the above aforesaid drugs to treat monkeypox disease to carry out QSPR analysis through the quadratic regression to predict physicochemical and ADMET properties of monkeypox drugs.

show abstract

“…The first attempt of labeling of graphs was seen in [1] in mid 1960s. Various types of Zumkeller labeling of graphs are seen in the literature [2,3,6,7].…”

Section: Introductionmentioning

confidence: 99%

A note on m-Zumkeller cordial labeling of graphs

Patodia

Saikia

2023

Proyecciones (Antofagasta)

View full text Add to dashboard Cite

Let G = (V,E) be a graph. An m-Zumkeller cordial labeling of the graph G is defined by an injective function f : V → N such that there exists an induced function f ∗ : E → {0, 1} defined by f ∗ (uv) = f (u) · f (v) that satisfies the following conditions- i. For every uv ∈ E, f ∗ (uv) = {█(1,if f (u) · f (v) is an m-Zumkeller number @ 0,otherwise )┤ ii. |ef ∗ (0) − ef∗ (1)| ≤ 1 where ef ∗ (0) and ef ∗ (1) denote the number of edges of the graph G having label 0 and 1 respectively under f ∗. In this paper we prove that there exist an m-Zumkeller cordial labeling of graphs in paths, cycles, comb graphs, ladder graphs, twig graphs, helm graphs, wheel graphs, crown graphs and star graphs.

show abstract

Zumkeller Cordial Labeling of Graphs

Cited by 5 publications

References 3 publications

k-Zumkeller Labeling of Graphs

k-Zumkeller Labeling of Graphs

Topological indices of molecular graphs of monkeypox drugs for QSPR analysis to predict physicochemical and ADMET properties

A note on m-Zumkeller cordial labeling of graphs

Contact Info

Product

Resources

About