Log in

Relevant bibliographies by topics / D)-Mean Labeling

Contents

Journal articles
Dissertations / Theses
Conference papers

Academic literature on the topic 'D)-Mean Labeling'

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 lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'D)-Mean Labeling.'

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.

Journal articles on the topic "D)-Mean Labeling"

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

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

3

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

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

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

6

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

7

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

8

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

9

Saraswathi, Meera, K. N. Meera, and Yuqing Lin. "Radio Mean Labeling Algorithm, Its Complexity and Existence Results." Mathematics 13, no. 13 (2025): 2057. https://doi.org/10.3390/math13132057.

Full text

Abstract:

Radio mean labeling of a connected graph G is an assignment of distinct positive integers to the vertices of G satisfying a mathematical constraint called radio mean condition. The maximum label assigned to any vertex of G is called the span of the radio mean labeling. The minimum span of all feasible radio mean labelings of G is the radio mean number of G, denoted by rmn(G). In our previous study, we proved that if G has order n, then rmn(G)∈[n,rmn(Pn)] where Pn is a path of order n. All graphs of diameters 1, 2 and 3 have the radio mean number equal to order n. However, they are not the only

APA, Harvard, Vancouver, ISO, and other styles

10

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

More sources

Dissertations / Theses on the topic "D)-Mean Labeling"

1

Krell, Katja [Verfasser], and H. A. [Akademischer Betreuer] Wagenknecht. "Fluorogenic Labeling of Oligonucleotides by Means of Photoclick-Reaction and Strain-Promoted Sydnone Alkyne Cycloaddition / Katja Krell ; Betreuer: H.-A. Wagenknecht." Karlsruhe : KIT-Bibliothek, 2021. http://d-nb.info/1226222056/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "D)-Mean Labeling"

1

Stamenić, Tamara, Maja Petričević, Slađana Šobajić, et al. "CHALLENGES OF THE NEW PRODUCT-LABELING SYSTEM IN THE MEAT INDUSTRY." In XX International Convention on Quality JUSK ICQ 2024. United Association of Serbia for Quality, 2024. http://dx.doi.org/10.46793/jusk-icqxx.145s.

Full text

Abstract:

Enhancing diet quality is a pivotal strategy in the battle against non-communicable diseases (NCDs) and a cornerstone of public health policy. The Nutri-Score, a front-of-pack (FOP) labeling system featuring five color-coded letters (A-E), serves as a beacon, guiding consumers towards healthier prepackaged foods. This system has a profound effect on consumer awareness, perception, comprehension, and purchasing behavior, potentially leading to a significant reduction in NCD prevalence. Despite their status as essential protein sources, processed meats have been associated with numerous diseases

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!