Log in

Relevant bibliographies by topics / D)-Mean Labeling; (k / Journal articles

To see the other types of publications on this topic, follow the link: D)-Mean Labeling; (k.

Journal articles on the topic 'D)-Mean Labeling; (k'

Author: Grafiati

Published: 3 June 2025

Last updated: 31 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'D)-Mean Labeling; (k.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

B., Gayathri, and Sulochana V. "(k, d)-MEAN LABELING OF SOME DISCONNECTED GRAPHS." International Journal of Research - Granthaalayah 5, no. 7SE (2017): 31–41. https://doi.org/10.5281/zenodo.840207.

Full text

Abstract:

The concept of mean labeling was introduced by Somasundaram and Ponraj. K-odd mean, (k,d)-odd mean labeling were introduced and discussed by Gayathri and Amuthavalli. K-mean, k-even mean and (k,d)-even mean labeling were further studied by Gayathri and Gopi. We have obtained (k,1)-mean labeling for some new families of graphs. We have introduced (k,d)-mean labeling and obtained results for some family of trees and for some special graphs. In this paper, we investigate (k,d)-mean labeling for some disconnected graphs. Here k and d denote any positive integer greater than or equal to 1.

APA, Harvard, Vancouver, ISO, and other styles

2

Gayathri, B., and V. Sulochana. "(k, d)-MEAN LABELING OF SOME DISCONNECTED GRAPHS." International Journal of Research -GRANTHAALAYAH 5, no. 7(SE) (2017): 31–41. http://dx.doi.org/10.29121/granthaalayah.v5.i7(se).2017.2040.

Full text

Abstract:

The concept of mean labeling was introduced by Somasundaram and Ponraj. K-odd mean, (k,d)-odd mean labeling were introduced and discussed by Gayathri and Amuthavalli. K-mean, k-even mean and (k,d)-even mean labeling were further studied by Gayathri and Gopi. We have obtained (k,1)-mean labeling for some new families of graphs. We have introduced (k,d)-mean labeling and obtained results for some family of trees and for some special graphs. In this paper, we investigate (k,d)-mean labeling for some disconnected graphs. Here k and d denote any positive integer greater than or equal to 1.

APA, Harvard, Vancouver, ISO, and other styles

3

Princy Kala, V. "k-super cube root cube mean labeling of graphs." Proyecciones (Antofagasta) 40, no. 5 (2021): 1097–116. http://dx.doi.org/10.22199/issn.0717-6279-4258.

Full text

Abstract:

Consider a graph G with |V (G)| = p and |E(G)| = q and let f : V (G) → {k, k + 1, k + 2, . . . p + q + k − 1}} be an injective function. The induced edge labeling f ∗ for a vertex labeling f is defined by f ∗ (e) = for all e = uv ∈ E(G) is bijective. If f(V (G)) ∪ {f ∗ (e) : e ∈ E(G)} = {k, k + 1, k + 2, . . . , p + q + k − 1}, then f is called a k-super cube root cube mean labeling. If such labeling exists, then G is a k-super cube root cube mean graph. In this paper, I introduce k-super cube root cube mean labeling and prove the existence of this labeling to the graphs viz., triangular snake

APA, Harvard, Vancouver, ISO, and other styles

4

Kalaimathy, S. "Some Results on (K, D) - Even Mean Labeling." International Journal of Mathematics and Soft Computing 2, no. 2 (2012): 103. http://dx.doi.org/10.26708/ijmsc.2012.2.2.14.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Gayathri, B., and R. Gopi. "$(K, D)$-Even Mean Labeling of $P_M \Odot NK_1$." International Journal of Mathematics and Soft Computing 1, no. 1 (2011): 17. http://dx.doi.org/10.26708/ijmsc.2011.1.1.03.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Locke, Rachel E., and Jeanne M. Nerbonne. "Three Kinetically Distinct Ca2+-Independent Depolarization-Activated K+ Currents in Callosal-Projecting Rat Visual Cortical Neurons." Journal of Neurophysiology 78, no. 5 (1997): 2309–20. http://dx.doi.org/10.1152/jn.1997.78.5.2309.

Full text

Abstract:

Locke, Rachel E. and Jeanne M. Nerbonne. Three kinetically distinct Ca2+-independent depolarization-activated K+ currents in callosal-projecting rat visual cortical neurons. J. Neurophysiol. 78: 2309–2320, 1997. Whole cell, Ca2+-independent, depolarization-activated K+ currents were characterized in identified callosal-projecting (CP) neurons isolated from postnatal day 7–16 rat primary visual cortex. CP neurons were identified in vitro after in vivo retrograde labeling with fluorescently tagged latex microbeads. During brief (160-ms) depolarizing voltage steps to potentials between −50 and +6

APA, Harvard, Vancouver, ISO, and other styles

7

Wei, Xiang, Yanfen Zou, Shunli Dong, Yi Chen, Guoping Li, and Bin Wang. "Recombinant hirudin attenuates pulmonary hypertension and thrombosis in acute pulmonary embolism rat model." PeerJ 12 (April 5, 2024): e17039. http://dx.doi.org/10.7717/peerj.17039.

Full text

Abstract:

Background Acute pulmonary embolism (APE) is classified as a subset of diseases that are characterized by lung obstruction due to various types of emboli. Current clinical APE treatment using anticoagulants is frequently accompanied by high risk of bleeding complications. Recombinant hirudin (R-hirudin) has been found to have antithrombotic properties. However, the specific impact of R-hirudin on APE remains unknown. Methods Sprague-Dawley (SD) rats were randomly assigned to five groups, with thrombi injections to establish APE models. Control and APE group rats were subcutaneously injected wi

APA, Harvard, Vancouver, ISO, and other styles

8

Tamilselvi, M., and T. Priya. "On k-Super Mean Labeling." International Journal of Scientific Engineering and Research 5, no. 8 (2017): 92–95. https://doi.org/10.70729/ijser171767.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Susanto, Faisal, Rinovia Simanjuntak2,, and Edy Tri Baskoro. "D-irregularity Strength of a Graph." Utilitas Mathematica 121, no. 1 (2024): 69–90. https://doi.org/10.61091/um121-06.

Full text

Abstract:

We initiate to study a \(D\)-irregular labeling, which generalizes both non-inclusive and inclusive \(d\)-distance irregular labeling of graphs. Let \(G=(V(G),E(G))\) be a graph, \(D\) a set of distances, and \(k\) a positive integer. A mapping \(\varphi\) from \(V(G)\) to the set of positive integers \(\{1,2,\dots,k\}\) is called a \(D\)-irregular \(k\)-labeling of \(G\) if every two distinct vertices have distinct weights, where the weight of a vertex \(x\) is defined as the sum of labels of vertices whose distance from \(x\) belongs to \(D\). The least integer \(k\) for which \(G\) admits a

APA, Harvard, Vancouver, ISO, and other styles

10

Shuping, He, and Wu Qiong. "The <i>L(j, k)</i>-Labeling Number and Circular <i>L(j,k)</i>-Labeling Number of Distance Graph D<sub>n</sub>(1,5)." International Journal of Systems Science and Applied Mathematics 10, no. 1 (2025): 7–11. https://doi.org/10.11648/j.ijssam.20251001.12.

Full text

Abstract:

For&lt;i&gt; j ≤ k&lt;/i&gt;, the &lt;i&gt;L(j, k)&lt;/i&gt;- labeling problem arose form the code assignment problem of the wireless network. That is, let n,j,k be non-negative real numbers with j ≤ k, an n-&lt;i&gt;L(j, k)&lt;/i&gt;-labeling of a graph G is mapping f: V(G)→[0, n] such that |f(u)-f(v)| ≥ j if d(u, v)=1, and |f(u)-f(v)|≥k if t d(u, v)=2. The span of f is the difference between the maximum and minimum labeling numbers assigned by &lt;i&gt;f&lt;/i&gt;. The &lt;i&gt;L(j, k)&lt;/i&gt;-labeling number o

APA, Harvard, Vancouver, ISO, and other styles

11

Gobind, Mohanty, Mishra Debdas, Sarangi Pravat, and Bhattacharjee Subarna. "Some New Classes of (k, d) Graceful 3 Distance Trees and 3 Distance Unicyclic Graphs." Indian Journal of Science and Technology 15, no. 14 (2022): 630–39. https://doi.org/10.17485/IJST/v15i14.254.

Full text

Abstract:

Abstract <strong>Objectives:</strong> To identify a new family of (k; d) graceful graphs. <strong>Methods :</strong> The methodology involves mathematical formulation for labeling of the vertices of a given graph and subsequently establishing that these formulations give rise to (k;d) graceful labeling. <strong>Findings:</strong> Here we define a three-distance tree as the tree possessing a path such that each vertex of the tree is at most at a distance three from that path. In this paper we identify two families of three distance trees that possess (k; d) graceful lab

APA, Harvard, Vancouver, ISO, and other styles

12

Princy Kala, V. "k-super cube root cube mean labeling of some corona graphs." Proyecciones (Antofagasta) 41, no. 4 (2022): 903–21. http://dx.doi.org/10.22199/issn.0717-6279-5200.

Full text

Abstract:

Let G be a graph with |V (G)| = p and |E (G)| = q and f : V (G) → {k, k+1, k+2,..., p+q+k − 1 } be an one-to-one function. The induced edge labeling f ∗, for a vertex labeling f is defined by f ∗(e) = for all e = uv ∈ E(G) is bijective. If f(V (G)) ∪ {f ∗(e) : e ∈ E(G)} = {k, k+1, k+2,..., p+q+k − 1}, then f is known as a k-super cube root cube mean labeling. If such labeling exists, then G is a k-super cube root cube mean graph. In this paper, I prove that Tn ʘ K1, A(Tn) ʘ K1, A(Tn) ʘ 2K1, A(Qn) ʘ K1, Pn ʘ K1,2 and Pn ʘ K1,3 are k-super cube root cube mean graphs.

APA, Harvard, Vancouver, ISO, and other styles

13

Yatin, Bela Zainun, Zata Yumni Awanis, and I. Gede Adhitya Wisnu Wardhana. "Super (a,d)-P_2⨀P_m-Antimagic Total Labeling of Corona Product of Two Paths." JTAM (Jurnal Teori dan Aplikasi Matematika) 8, no. 2 (2024): 454. http://dx.doi.org/10.31764/jtam.v8i2.20065.

Full text

Abstract:

Graph labeling involves mapping the elements of a graph (edges and vertices) to a set of positive integers. The concept of an anti-magic super outer labeling (a,d)-H pertains to assigning labels to the vertices and edges of a graph using natural numbers {1,2,3,...,p+q}. The weights of the outer labels H form an arithmetic sequence {a,a+d,a+2d,...,a+(k-1)d}, where 'a' represents the first term, 'd' is the common difference, and 'k' denotes the total number of outer labels, with the smallest label assigned to a vertex. This study investigates the super (a,d)-P_2⨀P_m-antimagic total labeling of t

APA, Harvard, Vancouver, ISO, and other styles

14

J., Vinolin, S. T. Ramesh D., and Athisayanathan S. "Skolem Mean Labeling of Four Star Graphs." International Journal of Engineering and Advanced Technology (IJEAT) 9, no. 3 (2020): 1994–96. https://doi.org/10.35940/ijeat.C5589.029320.

Full text

Abstract:

Skolem mean labeling of the four star G = K K K K ∪ ∪ ∪ 1 1, ,η η 1,τ 1,τ 1 2 1 2 where 2 η η  1 and  1 2   is a skolem mean graph if 2 2 1 1        1 2 i i i i   is the main purpose of this article . Here we partite the four star into two pairs and then found the labeling function which proves the four star to be skolem mean using mathematical calculations.

APA, Harvard, Vancouver, ISO, and other styles

15

Devi, S. Manimegala, and D. S. T. Ramesh. "L(3,2,1)-Labeling of the Jahangir Graph." International Journal of Fuzzy Mathematical Archive 15, no. 02 (2018): 205–8. http://dx.doi.org/10.22457/ijfma.v15n2a11.

Full text

Abstract:

An L(3,2,1)-labeling is a simplified model for the channel assignment problem. It is a natural generalization of the widely studied L(2,1)-labeling. An L(3,2,1)-labeling of a graph G is a function f from the vertex set V(G) to the set of positive integers such that for any two vertices x,y, if d(x,y) = 1, then │f(x) ─ f(y)│≥ 3; if d(x,y) = 2, then f(x) ─ f(y)│≥ 2; if d(x,y) = 3,then │f(x) ─ f(y)│≥ 1. The L(3,2,1)-labeling number K3(G) of G is the smallest positive integer k such that G has an L(3,2,1)-labeling with k as the maximum label. In this paper we determine the L(3,2,1)-labeling number

APA, Harvard, Vancouver, ISO, and other styles

16

K, Akilandeswari. "More Results on k-Super Mean Labeling." International Journal for Research in Applied Science and Engineering Technology 6, no. 4 (2018): 2858–64. http://dx.doi.org/10.22214/ijraset.2018.4476.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

selvi, M. Tamil, and N. Rev athi. "K-Harmonic Mean Labeling of Some Graphs." International Journal of Mathematics Trends and Technology 52, no. 4 (2017): 216–22. http://dx.doi.org/10.14445/22315373/ijmtt-v52p531.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

D., SRIRAM. "Union of 4-Total Mean Cordial Graph with the Star K1, N." International Journal of Innovative Science and Research Technology (IJISRT) 7, no. 2 (2024): 4. https://doi.org/10.5281/zenodo.10784511.

Full text

Abstract:

Consider (p, q) graph G and define f from the vertex set V (G) to the set Zk where k ∈ N and k > 1. Foreache uv, assign the label f (u)+f (v) 2, Then the function f is called as k-total mean cordial labeling of G if number of vertices and edges labelled by i and not labelled by i differ by at most 1, wherei ∈ {0, 1, 2, · · · , k − 1}. Suppose a graph admits  a k-total mean cordial labeling then it is called as k- total mean cordial graph.In this paper we investigate  the 4-total mean cordial labeling of G ∪ K1,n where G is a 4-total mean co

APA, Harvard, Vancouver, ISO, and other styles

19

Lourdusamy, A., F. Joy Beaula, and F. Patrick. "On Tades of Disjoint Union of Some Graphs." Ars Combinatoria 157 (December 31, 2023): 89–94. http://dx.doi.org/10.61091/ars157-09.

Full text

Abstract:

Consider a total labeling ξ of a graph G . For every two different edges e and f of G , let w t ( e ) ≠ w t ( f ) where weight of e = x y is defined as w t ( e ) = | ξ ( e ) – ξ ( x ) – ξ ( y ) | . Then ξ is called edge irregular total absolute difference k -labeling of G . Let k be the minimum integer for which there is a graph G with edge irregular total absolute difference labeling. This k is called the total absolute difference edge irregularity strength of the graph G , denoted t a d e s ( G ) . We compute t a d e s of S C n , disjoint union of grid and zigzag graph.

APA, Harvard, Vancouver, ISO, and other styles

20

Agustin, Ika Hesti, F. Susanto, Dafik, R. M. Prihandini, R. Alfarisi, and I. W. Sudarsana. "On H-Supermagic Labelings of m-Shadow of Paths and Cycles." International Journal of Mathematics and Mathematical Sciences 2019 (February 3, 2019): 1–7. http://dx.doi.org/10.1155/2019/8780329.

Full text

Abstract:

A simple graph G=(V,E) is said to be an H-covering if every edge of G belongs to at least one subgraph isomorphic to H. A bijection f:V∪E→{1,2,3,…,V+E} is an (a,d)-H-antimagic total labeling of G if, for all subgraphs H′ isomorphic to H, the sum of labels of all vertices and edges in H′ form an arithmetic sequence {a,a+d,…,(k-1)d} where a>0, d≥0 are two fixed integers and k is the number of all subgraphs of G isomorphic to H. The labeling f is called super if the smallest possible labels appear on the vertices. A graph that admits (super) (a,d)-H-antimagic total labeling is called (super) (

APA, Harvard, Vancouver, ISO, and other styles

21

Sugeng, Kiki Ariyanti, Denny Riama Silaban, Martin Bača, and Andrea Semaničová-Feňovčíková. "Local Inclusive Distance Vertex Irregular Graphs." Mathematics 9, no. 14 (2021): 1673. http://dx.doi.org/10.3390/math9141673.

Full text

Abstract:

Let G=(V,E) be a simple graph. A vertex labeling f:V(G)→{1,2,⋯,k} is defined to be a local inclusive (respectively, non-inclusive) d-distance vertex irregular labeling of a graph G if for any two adjacent vertices x,y∈V(G) their weights are distinct, where the weight of a vertex x∈V(G) is the sum of all labels of vertices whose distance from x is at most d (respectively, at most d but at least 1). The minimum k for which there exists a local inclusive (respectively, non-inclusive) d-distance vertex irregular labeling of G is called the local inclusive (respectively, non-inclusive) d-distance v

APA, Harvard, Vancouver, ISO, and other styles

22

Duraisamy, Kumar, S. Vimal Kumar, and Lawrence J.Sebastian. "Even Vertex In-Magic Total Labeling Of Digraphs." Proyecciones (Antofagasta) 44, no. 1 (2025): 1–8. https://doi.org/10.22199/issn.0717-6279-5866.

Full text

Abstract:

Let $D = (V, A)$ be a directed graph with $p$ vertices and $q$ arcs. An even vertex in-magic total labeling (EVIMTL) is a bijection $\lambda: V(D) \cup A(D) \rightarrow \{ 1,2 , \ldots, p + q \}$ with the property that $\lambda(V(D)) = \{ 2,4,\ldots, 2p \}$ and for each $v \in V(D)$, $\lambda(v) + \sum\limits_{u \in I(v)} \lambda((v,u)) = k$ for some positive integer $k$. A digraph that admits an EVIMTL is called an even vertex in-magic total(EVIMT).In this paper, we study some basic properties of EVIMTL. Using these properties, we prove theexistence and non-existence of EVIMTL for some famili

APA, Harvard, Vancouver, ISO, and other styles

23

Prajapati, U. M., and Anit Vantiya. "SD-Prime cordial labeling of alternate k-polygonal snake of various types." Proyecciones (Antofagasta) 40, no. 3 (2021): 619–34. http://dx.doi.org/10.22199/issn.0717-6279-4015.

Full text

Abstract:

Let f : V (G) → {1, 2,..., |V (G)|} be a bijection, and let us denote S = f(u) + f(v) and D = |f(u) − f(v)| for every edge uv in E(G). Let f' be the induced edge labeling, induced by the vertex labeling f, defined as f' : E(G) → {0, 1} such that for any edge uv in E(G), f' (uv)=1 if gcd(S, D)=1, and f' (uv)=0 otherwise. Let ef' (0) and ef' (1) be the number of edges labeled with 0 and 1 respectively. f is SD-prime cordial labeling if |ef' (0) − ef' (1)| ≤ 1 and G is SD-prime cordial graph if it admits SD-prime cordial labeling. In this paper, we have discussed the SD-prime cordial labeling of

APA, Harvard, Vancouver, ISO, and other styles

24

M, Tamilselvi. "K-Super Mean Labeling of Cycle Related Graphs." International Journal for Research in Applied Science and Engineering Technology 6, no. 4 (2018): 868–73. http://dx.doi.org/10.22214/ijraset.2018.4147.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

M, Tamilselvi. "Some New Graphs on k-Super Mean Labeling." International Journal for Research in Applied Science and Engineering Technology 6, no. 4 (2018): 3147–53. http://dx.doi.org/10.22214/ijraset.2018.4524.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Tamilselvi, M., and K. Synthiya. "On k-Super Mean Labeling of Some Graphs." International Journal of Scientific Engineering and Research 5, no. 9 (2017): 44–47. https://doi.org/10.70729/ijser171861.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

M, Tamilselvi, and Akilandeswari K. "k � Super Heronian Mean Labeling of Some Graphs." Journal of Computer and Mathematical Sciences 9, no. 6 (2018): 657–64. http://dx.doi.org/10.29055/jcms/801.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

M.J., Abisha, and Rubin Mary K. "k-Lehmer three mean labeling of some graphs." Malaya Journal of Matematik 8, no. 3 (2020): 1219–21. http://dx.doi.org/10.26637/mjm0803/0085.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Anitha, H., S. K. Sowjanya, Shanmukha B, and K. R. Karthik. "K - Power-3 Heronian Mean Labeling of Graphs." International Journal of Mathematics and Computer Research 12, no. 11 (2024): 4571–76. https://doi.org/10.5281/zenodo.14191351.

Full text

Abstract:

We describe a function  as  – Power 3. If constitute both the induced edge labelling and take be an injective function and express it as, then a graph's Heronian Mean Labelling  with p nodes and q lines is  or  with distinct edge labels. In this manuscript we have proved the – Power -3 Mean labeling behaviour of Path, Twig Graph, Triangular ladder . We have also investigated  - Super power -3 Heronian Mean labelling of graghs. Also, we prove that  is not – Power - 3 Heronian Mean graph and  - Super power -3 Heronian Mean labelling of Sn

APA, Harvard, Vancouver, ISO, and other styles

30

Deen, Mohamed R. Zeen El, and Nora A. Omar. "Similar d– even vertex odd mean labeling of diverse graphs." Journal of Information and Optimization Sciences 44, no. 7 (2023): 1365–96. http://dx.doi.org/10.47974/jios-1352.

Full text

Abstract:

An injective function F where, F : V(G) → {0,2,4, ..., 2b + 2d - 2} is said to be d-even vertex odd mean labeling (d-EVOML) of the graph G(a, b) when the induced mapping F* : E(G) → {1,3, ..., 2b - 1} given by: F*(lw) = F(l)+F(w)/2, is a bijective function. A d - even vertex odd mean graph is a graph which allows even vertex odd mean labelling. In this study, we identify the lowest value of d for which the graphs: Y-tree, star graph, Px ʘ Kh, crown graph Rh, and rooted product Ph◊C4 have a d- even vertex odd mean labeling. Furthermore, we find the minimum number d for which the graphs: cycle g

APA, Harvard, Vancouver, ISO, and other styles

31

Hao, Jianqiang, Yunzhan Gong, Jianzhi Sun, and Li Tan. "Use the K-Neighborhood Subgraphs to Compute Canonical Labelings of Graphs." Mathematics 7, no. 8 (2019): 690. http://dx.doi.org/10.3390/math7080690.

Full text

Abstract:

This paper puts forward an innovative theory and method to calculate the canonical labelings of graphs that are distinct to N a u t y ’s. It shows the correlation between the canonical labeling of a graph and the canonical labeling of its complement graph. It regularly examines the link between computing the canonical labeling of a graph and the canonical labeling of its o p e n k-n e i g h b o r h o o d s u b g r a p h. It defines d i f f u s i o n d e g r e e s e q u e n c e s and e n t i r e d i f f u s i o n d e g r e e s e q u e n c e. For each node of a graph G, it designs a characterist

APA, Harvard, Vancouver, ISO, and other styles

32

R Gopi. "k-Contra Harmonic Mean Labeling of Snake Related Graphs." Mathematical Journal of Interdisciplinary Sciences 7, no. 2 (2019): 77–80. http://dx.doi.org/10.15415/mjis.2019.72010.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Tamilselvi, M., and N. Revathi. "k–Super Harmonic Mean Labeling of Certain Snake Graphs." Annals of Pure and Applied Mathematics 15, no. 1 (2017): 105–14. http://dx.doi.org/10.22457/apam.v15n1a10.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Ahmad, Ali. "A Note on Distance Irregular Labeling of Graphs." Ars Combinatoria 156 (July 31, 2023): 35–42. http://dx.doi.org/10.61091/ars156-4.

Full text

Abstract:

Let us consider a~simple connected undirected graph G = ( V , E ) . For a~graph G we define a~ k -labeling ϕ : V ( G ) → { 1 , 2 , … , k } to be a~distance irregular vertex k -labeling of the graph G if for every two different vertices u and v of G , one has w t ( u ) ≠ w t ( v ) , where the weight of a~vertex u in the labeling ϕ is w t ( u ) = ∑ v ∈ N ( u ) ϕ ( v ) , where N ( u ) is the set of neighbors of u . The minimum k for which the graph G has a~distance irregular vertex k -labeling is known as distance irregularity strength of G , it is denoted as d i s ( G ) . In this paper, we deter

APA, Harvard, Vancouver, ISO, and other styles

35

Anitha, K., B. Selvam, and K. Thirusangu. "K-Graceful, Odd-Even Graceful, Heronian Mean and Analytic Mean Labeling for the Extended Duplicate Graph of Kite Graph." International Journal of Engineering & Technology 7, no. 4.10 (2018): 355. http://dx.doi.org/10.14419/ijet.v7i4.10.20934.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Guerra, Alberto D., Annie Kennedy, Cynthia Adams, et al. "Abstract 2012: A humanized anaplastic lymphoma kinase (ALK)-directed antibody-drug conjugate (ADC) demonstrates potent cytotoxicity in neuroblastoma (NBL) and fusion positive rhabdomyosarcoma (FP RMS)." Cancer Research 82, no. 12_Supplement (2022): 2012. http://dx.doi.org/10.1158/1538-7445.am2022-2012.

Full text

Abstract:

Abstract Introduction: ALK is a lineage restricted oncoprotein expressed on the cell surface of NBL as wild-type (WT), mutated, or amplified, and recently shown to be overexpressed in FP RMS. Small molecule inhibitors have shown potent efficacy in NBL with ALK mutations or amplifications, but is limited to a minority of the high-risk population and have demonstrated conferred resistance. We have previously shown the potential of an ADC approach for WT ALK-expressing NBL with a chimeric ALK-directed ADC CDX-0125. Methods: A highly specific humanized ALK antibody KTN0239 was developed with site-

APA, Harvard, Vancouver, ISO, and other styles

37

V. T., Brindha Mary, C. David Raj, and C. Jayasekaran. "EVEN RADIO MEAN GRACEFUL LABELING ON DEGREE SPLITTING OF SNAKE RELATED GRAPHS." South East Asian J. of Mathematics and Mathematical Sciences 18, no. 02 (2022): 197–204. http://dx.doi.org/10.56827/seajmms.2022.1802.18.

Full text

Abstract:

A radio mean labeling of a connected graph G is an injection φ from the vertex set V(G) to N such that the condition d(u, v) + & φ(u)+φ(v) 2 ' ≥ 1 + diam(G) holds for any two distinct vertices u and v of G. A graph which admits radio mean labeling is called radio mean graph. The radio mean number of φ, rmn(φ), is the maximum number assigned to any vertex of G. The radio mean number of G, rmn(G), is the minimum value of rmn(φ) taken over all radio mean labeling φ of G. In this paper we introduce a new concept even radio mean graceful labeling and we investigate th

APA, Harvard, Vancouver, ISO, and other styles

38

Et al., P. K. Hemalatha. "A Modified Fuzzy Labeling Graph using Geometric Mean and Harmonic mean and its Application." Advances in Nonlinear Variational Inequalities 26, no. 2 (2023): 15–35. http://dx.doi.org/10.52783/anvi.v26.i2.252.

Full text

Abstract:

The Modified Fuzzy Labeling Graph (MFLG) has gained popularity in the field of image processing due to its ability to accurately represent complex images. However, there are limitations to the MFLG approach that can be addressed through the use of geometric mean and harmonic measures. In this paper, the authors propose a new idea on a modified fuzzy labeling graph. A Modified fuzzy (M ) graph σ is a function from V to [0,1] and µ is a function from E to [0,1] where ∀ . The modified fuzzy labeling has an edge value, which is less than or equal to the maximum of two endpoints that is To obtain t

APA, Harvard, Vancouver, ISO, and other styles

39

Indriati, Diari, and Tsabita Azzahra. "EDGE IRREGULAR REFLEXIVE LABELING ON MONGOLIAN TENT GRAPH (M_(m,3)) AND DOUBLE QUADRILATERAL SNAKE GRAPH." BAREKENG: Jurnal Ilmu Matematika dan Terapan 17, no. 4 (2023): 1933–40. http://dx.doi.org/10.30598/barekengvol17iss4pp1933-1940.

Full text

Abstract:

Let G be an undirected, connected, and simple graph with edges set E(G)and vertex set V(G). An edge irregular reflexive k-labeling f is one in which the label for each edge is an integer number {1,2,…, k_e} and the label for each vertex is an even integer number {0,2,4,…,2k_v}, k = max{ k_e,2k_v}. This type of labeling results in distinct weights for each edge. The weight of an edge xy in a graph G with labeling f, indicated by wt (xy), is the total of the labels on the vertex that are incident to the edge as well as the edge label. The minimum value k of the largest label in the graph G is re

APA, Harvard, Vancouver, ISO, and other styles

40

Kumar, Solomon Stalin. "H - V -Super-Strong- ( a , d ) -antimagic decomposition of complete bipartite graphs." Ars Combinatoria 157 (December 31, 2023): 73–80. http://dx.doi.org/10.61091/ars157-07.

Full text

Abstract:

An H -(a,d)-antimagic labeling in a H -decomposable graph G is a bijection f : V ( G ) ∪ E ( G ) → { 1 , 2 , … , p + q } such that ∑ f ( H 1 ) , ∑ f ( H 2 ) , ⋯ , ∑ f ( H h ) forms an arithmetic progression with difference d and first element a . f is said to be H - V -super- ( a , d ) -antimagic if f ( V ( G ) ) = { 1 , 2 , … , p } . Suppose that V ( G ) = U ( G ) ∪ W ( G ) with | U ( G ) | = m and | W ( G ) | = n . Then f is said to be H - V -super-strong- ( a , d ) -antimagic labeling if f ( U ( G ) ) = { 1 , 2 , … , m } and f ( W ( G ) ) = { m + 1 , m + 2 , … , ( m + n = p ) } . A graph th

APA, Harvard, Vancouver, ISO, and other styles

41

V.T. Brindha Mary, C. David Raj, and C. Jayasekaran. "Radio even mean graceful labeling on some special graphs." Malaya Journal of Matematik 8, no. 04 (2020): 2323–28. http://dx.doi.org/10.26637/mjm0804/0175.

Full text

Abstract:

Radio Even Mean Graceful Labeling of a connected graph \(G\) is a bijection \(\phi\) from the vertex set \(V(G)\) to \(\{2,4,6, \ldots 2|V|\}\) satisfying the condition \(d(s, t)+\left\lceil\frac{\phi(s)+\phi(t)}{2}\right\rceil \geq 1+\operatorname{diam}(G)\) for every \(\mathrm{s}, \mathrm{t} \in \mathrm{V}(\mathrm{G})\). A graph which admits radio even mean graceful labeling is called radio even mean graceful graph. In this paper we investigate the radio even mean graceful labeling on degree splitting of some special graphs.

APA, Harvard, Vancouver, ISO, and other styles

42

Sunoj, B. S., and Varkey T. K. Mathew. "Oblong Mean Prime Labeling of Some Tree Graphs." International Journal of Trend in Scientific Research and Development 2, no. 2 (2018): 222–26. https://doi.org/10.31142/ijtsrd8375.

Full text

Abstract:

The labeling of a graph, we mean assign some integers to the vertices or edges or both of the graph. Here the vertices of the graph are labeled with oblong numbers and the edges are labeled with mean of the end vertex labels. Here the greatest common incidence number gcin of a vertex of degree greater than one is defined as the greatest common divisor of the labels of the incident edges. If the gcin of each vertex of degree greater than one is 1, then the graph admits oblong mean prime labeling. Here we characterize some tree graphs for oblong mean prime labeling. Sunoj B S | Mathew Varkey T K

APA, Harvard, Vancouver, ISO, and other styles

43

Poomalai, P., R. Vikramaprasad, and P. Malliga. "ON RADIO ANALYTIC MEAN D-DISTANCE NUMBER OF MORE GRAPHS." Advances in Mathematics: Scientific Journal 9, no. 11 (2020): 9237–45. http://dx.doi.org/10.37418/amsj.9.11.29.

Full text

Abstract:

A Radio Analytic Mean D-distance labeling of associated diagram $G$ is a balanced guide $v$ from the vertex set $V(G)$ to $N$ such that for two distinct vertices $u$ and $v$ of $G$. $d^D\left(u,v\right) +\left\lceil \frac{\left|f({u)}^2-f(v)^2\right|}{2}\right\rceil \ge 1+\ {diam}^{D\ }(G)$.

APA, Harvard, Vancouver, ISO, and other styles

44

Poomalai, P., R. Vikramaprasad, and P. Malliga. "RADIO ANALYTIC MEAN D-DISTANCE LABELING OF SOME BASIC GRAPHS." Advances in Mathematics: Scientific Journal 9, no. 8 (2020): 5785–94. http://dx.doi.org/10.37418/amsj.9.8.46.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

T, Arputha Jose, Daniel Raj A, Venugopal P, and Giridaran M. "Radio antipodal mean number of quadrilateral Snake families." Indian Journal of Science and Technology 14, no. 13 (2021): 1071–80. https://doi.org/10.17485/IJST/v14i13.295.

Full text

Abstract:

Abstract <strong>Objectives:</strong> In communication engineering, the assignment of channels or frequencies to different transmitters in a communication network without interference is an important problem. Finding the span for such an assignment is a challenging task. The objective of this study is to find the span of quadrilateral snake families. <strong>Method:</strong> The solution to the channel assignment problem can be found out by modeling the communication network as a graph, where the transmitters are represented by nodes and connectivity between transmitters are giv

APA, Harvard, Vancouver, ISO, and other styles

46

Frank, JS, G. Mottino, D. Reid, RS Molday, and KD Philipson. "Distribution of the Na(+)-Ca2+ exchange protein in mammalian cardiac myocytes: an immunofluorescence and immunocolloidal gold-labeling study." Journal of Cell Biology 117, no. 2 (1992): 337–45. http://dx.doi.org/10.1083/jcb.117.2.337.

Full text

Abstract:

The present study reports on the location of the Na(+)-Ca2+ exchanger in cardiac sarcolemma with immunofluorescence and immunoelectron microscopy. Both polyclonal and monoclonal antibodies to the Na(+)-Ca2+ exchanger were used. The mAb was produced from a hybridoma cell line generated by the fusion of mouse myeloma NS-1 cells with spleen cells from a mouse repeatedly immunized with isolated reconstituted canine cardiac Na(+)-Ca2+ exchanger (Philipson, K. D. S. Longoni, and R. Ward. 1988. Biochim. Biophys. Acta. 945:298-306). The polyclonal antibody has been described previously and reacts with

APA, Harvard, Vancouver, ISO, and other styles

47

Radha, R., and N. Mohamed Rilwan. "Frequency Assignment Model of Zero Divisor Graph." Journal of Applied Mathematics 2021 (March 9, 2021): 1–8. http://dx.doi.org/10.1155/2021/6698815.

Full text

Abstract:

Given a frequency assignment network model is a zero divisor graph Γ = V , E of commutative ring R η , in this model, each node is considered to be a channel and their labelings are said to be the frequencies, which are assigned by the L 2 , 1 and L 3 , 2 , 1 labeling constraints. For a graph Γ , L 2 , 1 labeling is a nonnegative real valued function f : V G ⟶ 0 , ∞ such that ∣ f x − f y ∣ ≥ 2 d if d = 1 and ∣ f x − f y ∣ ≥ d if d = 2 where x and y are any two vertices in V and d > 0 is a distance between x and y . Similarly, one can extend this distance labeling terminology up to the diame

APA, Harvard, Vancouver, ISO, and other styles

48

Naseem, Asim, Khurram Shabbir, and M. Ramzan. "Further Results on Radio Number of Wedge sum of Graphs." Ars Combinatoria 156 (July 22, 2023): 13–23. http://dx.doi.org/10.61091/ars156-02.

Full text

Abstract:

Let \(G\) be a simple connected graph with vertex set \(V\) and diameter \(d\). An injective function \(c: V\rightarrow \{1,2,3,\ldots\}\) is called a {radio labeling} of \(G\) if \({|c(x)-c(y)|+d(x,y)\geq d+1}\) for all distinct \(x,y\in V\), where \(d(x,y)\) is the distance between vertices \(x\) and \(y\). The largest number in the range of \(c\) is called the span of the labeling \(c\). The radio number of \(G\) is the minimum span taken over all radio labelings of \(G\). For a fixed vertex \(z\) of \(G\), the sequence \((l_1,l_2,\ldots,l_r)\) is called the level tuple of \(G\), where \(l_

APA, Harvard, Vancouver, ISO, and other styles

49

Naseem, Asim, Khurram Shabbir, and M. Ramzan. "Further Results on Radio Number of Wedge sum of Graphs." Ars Combinatoria 156 (July 31, 2023): 13–23. http://dx.doi.org/10.61091/ars156-2.

Full text

Abstract:

Let G be a simple connected graph with vertex set V and diameter d . An injective function c : V → { 1 , 2 , 3 , … } is called a radio labeling of G if | c ( x ) c ( y ) | + d ( x , y ) ≥ d + 1 for all distinct x , y ∈ V , where d ( x , y ) is the distance between vertices x and y . The largest number in the range of c is called the span of the labeling c . The radio number of G is the minimum span taken over all radio labelings of G . For a fixed vertex z of G , the sequence ( l 1 , l 2 , … , l r ) is called the level tuple of G , where l i is the number of vertices whose distance from z is i

APA, Harvard, Vancouver, ISO, and other styles

50

Murugan, A. Nellai, and Shiny Priyanka. "TREE RELATED EXTENDED MEAN CORDIAL GRAPHS." International Journal of Research -GRANTHAALAYAH 3, no. 9 (2015): 143–48. http://dx.doi.org/10.29121/granthaalayah.v3.i9.2015.2954.

Full text

Abstract:

Let G = (V,E) be a graph with p vertices and q edges. A Extended Mean Cordial Labeling of a Graph G with vertex set V is a bijection from V to {0, 1,2} such that each edge uv is assigned the label where ⌈ x ⌉ is the least integer greater than or equal to x with the condition that the number of vertices labeled with 0 and the number of vertices labeled with 1 differ by at most 1 and the number of edges labeled with 0 and the number of edges labeled with 1 differ by almost 1. The graph that admits an Extended Mean Cordial Labeling is called Extended Mean Cordial Graph. In this paper, we proved t

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!