Log in

Relevant bibliographies by topics / Relaxed mean graph / Journal articles

To see the other types of publications on this topic, follow the link: Relaxed mean graph.

Journal articles on the topic 'Relaxed mean graph'

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 'Relaxed mean graph.'

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

Abraham, K. Samuel, Vinolin J., and S. T. Ramesh D. "Relaxed Skolem Mean Labeling of Four Star." International Journal of Engineering and Advanced Technology (IJEAT) 9, no. 3 (2020): 3577–78. https://doi.org/10.35940/ijeat.C6394.029320.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Dr., D. Angel Jovanna. "Relaxed Skolem Mean Labeling of 4 - Star Graph with Partition (3,1)." International Journal of Mathematics and Computer Research 13, no. 04 (2025): 5084–86. https://doi.org/10.5281/zenodo.15233852.

Full text

Abstract:

To prove that the 4 - star graph  where  is a relaxed skolem mean graph if  ꞵ - α<sub>1 – </sub>α<sub>2 – </sub>α<sub>3 = </sub>6 is the core objective of this article.

APA, Harvard, Vancouver, ISO, and other styles

3

Dr., D.S.T. Ramesh, and Angel Jovanna D. "Relaxed Skolam Mean Labeling of 5 – Star Graphs with Partition 3, 2." International Journal of Engineering and Advanced Technology (IJEAT) 11, no. 2 (2021): 9–11. https://doi.org/10.35940/ijeat.B3250.1211221.

Full text

Abstract:

<strong>Abstract: </strong>In this article, our main topic is about the existence of relaxed skolem mean labeling for a 5 – star graph G = K1,α ∪ K1,α ∪ K1,α ∪ K1, β ∪ K1, β 1 2 3 1 2 with partition 3, 2 with a certain condition. By using the trial and error method we find the existence of the relaxed skolam mean labeling of 5 - star graph with partition 3, 2 with a specific condition.

APA, Harvard, Vancouver, ISO, and other styles

4

Abraham, K. Samuel, Vinolin J., and S. T. Ramesh D. "Relaxed Skolem Mean Labeling of Four Star." International Journal of Engineering and Advanced Technology (IJEAT) 9, no. 3 (2020): 3743–45. https://doi.org/10.35940/ijeat.C6354.029320.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Dr., D.S.T. Ramesh, and Angel Jovanna D. "Relaxed Skolam Mean Labeling of 6 – Star Graphs with Partition 3, 3." International Journal of Engineering and Advanced Technology (IJEAT) 11, no. 2 (2021): 52–54. https://doi.org/10.35940/ijeat.B3281.1211221.

Full text

Abstract:

<strong>Abstract: </strong>Existence Relaxed skolam mean labeling for a 6 – star graph 3 G = K1,α K1,α K1,α K1,β K1,β K1,β 1 2 3 1 2 ∪ ∪ ∪ ∪ ∪ with partition 3,3 with a certain condition is the core topic of the following article. Trial and error method is used to find the existence of the relaxed skolam mean labeling of 6 - star graph with partition 3, 3 holding a specific condition.

APA, Harvard, Vancouver, ISO, and other styles

6

Ramesh, D. S. T., and D. Angel Jovanna. "Relaxed Skolam Mean Labeling of 5 – Star Graphs with Partition 3, 2." International Journal of Engineering and Advanced Technology 11, no. 2 (2021): 9–11. http://dx.doi.org/10.35940/ijeat.b3250.1211221.

Full text

Abstract:

In this article, our main topic is about the existence of relaxed skolem mean labeling for a 5 – star graph G = K1,α ∪ K1,α ∪ K1,α ∪ K1, β ∪ K1, β 1 2 3 1 2 with partition 3, 2 with a certain condition. By using the trial and error method we find the existence of the relaxed skolam mean labeling of 5 - star graph with partition 3, 2 with a specific condition.

APA, Harvard, Vancouver, ISO, and other styles

7

Ramesh, Dr D. S. T., and D. Angel Jovanna. "Relaxed Skolam Mean Labeling of 6 – Star Graphs with Partition 3, 3." International Journal of Engineering and Advanced Technology 11, no. 2 (2021): 52–54. http://dx.doi.org/10.35940/ijeat.b3281.1211221.

Full text

Abstract:

Existence Relaxed skolam mean labeling for a 6 – star graph 3 G = K1,α K1,α K1,α K1,β K1,β K1,β 1 2 3 1 2 ∪ ∪ ∪ ∪ ∪ with partition 3,3 with a certain condition is the core topic of the following article. Trial and error method is used to find the existence of the relaxed skolam mean labeling of 6 - star graph with partition 3, 3 holding a specific condition.

APA, Harvard, Vancouver, ISO, and other styles

8

Dr., A. Nellai Murugan, and Shiny Priyanka J. "TREE RELATED EXTENDED MEAN CORDIAL GRAPHS." International Journal of Research – Granthaalayah 3, no. 9 (2017): 143–48. https://doi.org/10.5281/zenodo.851935.

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 th

APA, Harvard, Vancouver, ISO, and other styles

9

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

10

Dhanalakshmi, S., and N. Parvathi. "Mean Square Cordial Labeling of Some Cycle Related Graphs." International Journal of Engineering & Technology 7, no. 4.10 (2018): 797. http://dx.doi.org/10.14419/ijet.v7i4.10.26119.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

R. Pappathi, M. P. Syed Ali Nisaya. "l-HILBERT MEAN LABELING OF SOME PATH RELATED GRAPHS." Tuijin Jishu/Journal of Propulsion Technology 44, no. 3 (2023): 4710–16. http://dx.doi.org/10.52783/tjjpt.v44.i3.2637.

Full text

Abstract:

Let be a graph with vertices and edges. The th hilbert number is denoted by and is defined by where A - hilbert mean labeling is an injective function , where that induces a bijection defined by for all . A graph which admits such labeling is called a - hilbert mean graph. In this paper, a new type of labeling called - hilbert mean labeling is introduced and the path related graphs is studied. AMS Subject Classification – 05C78

APA, Harvard, Vancouver, ISO, and other styles

12

K, Venkatesan*1 &. K. Thirugnanasambandam2. "SUPER ROOT SQUARE MEAN LABELING OF SOME CYCLE RELATED GRAPHS." GLOBAL JOURNAL OF ENGINEERING SCIENCE AND RESEARCHES 5, no. 11 (2018): 221–34. https://doi.org/10.5281/zenodo.1495607.

Full text

Abstract:

Let G be a graph with p vertices and q edges. Let :V(G)E(G)→{1,2,3,...,p+q} be an injective function.  For a vertex labeling ,  the induced edge labeling  is defined by =. Thenis called a super root square mean labeling, if .A graph which admits super root square mean labeling is called super root square mean graph. In this paper, we establish the existence of  super root square mean labeling of  a  few family of cycle related graphs.

APA, Harvard, Vancouver, ISO, and other styles

13

Et. al., Meera Saraswathi,. "Radio Mean Labeling Of Paths And Its Total Graph." Turkish Journal of Computer and Mathematics Education (TURCOMAT) 12, no. 1S (2021): 343–50. http://dx.doi.org/10.17762/turcomat.v12i1s.1843.

Full text

Abstract:

A graph labeling problem is an assignment of labels to the vertices or edges (or both) of a graph G satisfying some mathematical condition. Radio Mean Labeling, a vertex-labeling of graphs with non-negative integers has a significant application in the study of problems related to radio channel assignment. The maximum label used in a radio mean labeling is called its span, and the lowest possible span of a radio mean labeling is called the radio mean number of a graph. In this paper, we obtain the radio mean number of paths and total graph of paths.

APA, Harvard, Vancouver, ISO, and other styles

14

B S, Sunoj, and Mathew Varkey T K. "MEAN SUM SQUARE PRIME LABELING OF SOME CYCLE RELATED GRAPHS." International Journal of Engineering Technologies and Management Research 4, no. 12 (2020): 21–27. http://dx.doi.org/10.29121/ijetmr.v4.i12.2017.131.

Full text

Abstract:

Mean sum square prime labeling of a graph is the labeling of the vertices with {0,1,2---,p-1} and the edges with mean of the square of the sum of the labels of the incident vertices or mean of the square of the sum of the labels of the incident vertices and one, depending on the sum is even or odd. The greatest common incidence number of a vertex (gcin) 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 one, then the graph admits mean sum square prime labeling. Here we identify some

APA, Harvard, Vancouver, ISO, and other styles

15

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

16

Sunoj, B. S., and Varkey T. K. Mathew. "MEAN SUM SQUARE PRIME LABELING OF SOME CYCLE RELATED GRAPHS." International Journal of Engineering Technologies and Management Research 4, no. 12 (2017): 31–37. https://doi.org/10.5281/zenodo.1133510.

Full text

Abstract:

<strong><em>Mean  sum square prime labeling of a graph is the labeling of the vertices with {0,1,2---,p-1} and the edges with mean  of the square of the sum of the labels of the incident vertices or mean of the square of the sum of the labels of the incident vertices and one, depending on the  sum is even or odd. The greatest common incidence number of a vertex (gcin) 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 one, then the graph admits mean sum square prime la

APA, Harvard, Vancouver, ISO, and other styles

17

Senthilkumar, V., and K. Venkatesan. "Odd vertex even edge root square mean labelling graphs." Journal of Interdisciplinary Mathematics 27, no. 5 (2024): 1001–8. http://dx.doi.org/10.47974/jim-1923.

Full text

Abstract:

Let G be a graph with p-vertices and q edges. A graph G is said to be odd vertex even edge root square mean labelling if there exist an injective map f : V(G)→{1, 2, 3…..2q+1} such that the induced edge labels are even and distinct which can be obtained by f *(e) = √(f(u)2+f(v)2/2 or √f(u)2+f(v)2)/2. A graph that allows such labelling is called an odd vertex even edge root square mean labelling graph. This paper introduces this new labelling type and discusses several related theorems concerning path graphs.

APA, Harvard, Vancouver, ISO, and other styles

18

Raza, Ali, Mobeen Munir, Tasawar Abbas, Sayed M. Eldin, and Ilyas Khan. "Spectrum of prism graph and relation with network related quantities." AIMS Mathematics 8, no. 2 (2022): 2634–47. http://dx.doi.org/10.3934/math.2023137.

Full text

Abstract:

<abstract><p>Spectra of network related graphs have numerous applications in computer sciences, electrical networks and complex networks to explore structural characterization like stability and strength of these different real-world networks. In present article, our consideration is to compute spectrum based results of generalized prism graph which is well-known planar and polyhedral graph family belongs to the generalized Petersen graphs. Then obtained results are applied to compute some network related quantities like global mean-first passage time, average path length, number o

APA, Harvard, Vancouver, ISO, and other styles

19

Alanazi, A. M., G. Muhiuddin, A. R. Kannan, and V. Govindan. "New Perspectives on Classical Meanness of Some Ladder Graphs." Journal of Mathematics 2021 (June 30, 2021): 1–14. http://dx.doi.org/10.1155/2021/9926350.

Full text

Abstract:

In this study, we investigate a new kind of mean labeling of graph. The ladder graph plays an important role in the area of communication networks, coding theory, and transportation engineering. Also, we found interesting new results corresponding to classical mean labeling for some ladder-related graphs and corona of ladder graphs with suitable examples.

APA, Harvard, Vancouver, ISO, and other styles

20

Sanli, Utkum, Feriha Celik, Sadik Delen, and Ismail Cangul. "Connectedness criteria for graphs by means of omega invariant." Filomat 34, no. 2 (2020): 647–52. http://dx.doi.org/10.2298/fil2002647s.

Full text

Abstract:

A realizable degree sequence can be realized in many ways as a graph. There are several tests for determining realizability of a degree sequence. Up to now, not much was known about the common properties of these realizations. Euler characteristic is a well-known characteristic of graphs and their underlying surfaces. It is used to determine several combinatorial properties of a surface and of all graphs embedded onto it. Recently, last two authors defined a number ? which is invariant for all realizations of a given degree sequence. ? is shown to be related to Euler characteristic and cycloma

APA, Harvard, Vancouver, ISO, and other styles

21

Shalini, P., and S. Tamizharasi. "A Study on Power-3 Heronian Odd Mean Labeling for some Path Related Graphs." International Journal for Research in Applied Science and Engineering Technology 11, no. 4 (2023): 1136–39. http://dx.doi.org/10.22214/ijraset.2023.50258.

Full text

Abstract:

In this article, we discussed Power-3 Heronian odd Mean Labeling for some path related graphs. A function is said to be Power 3 Heronian odd mean labeling of a graph G with q edges, if f is a bijective function from the vertices of G to the set{1,3,5,.......2p-1}such that when each edges uv is assigned the label, then the resulting edge labels are distinct numbers.

APA, Harvard, Vancouver, ISO, and other styles

22

Ponraj, R., S. Prabhu, and M. Sivakumar. "PMC-LABELING OF SOME CLASSES OF GRAPHS CONTAINING CYCLES." BAREKENG: Jurnal Ilmu Matematika dan Terapan 19, no. 2 (2025): 1445–56. https://doi.org/10.30598/barekengvol19iss2pp1445-1456.

Full text

Abstract:

Let be a graph with p vertices and q edges. We have introduced a new graph labeling method using integers and cordial-related works and investigated some graphs for this labeling technique. Using this labeling concept, we have examined the graphs like path, cycle, star, complete graph, comb, and wheel graph. The first research paper on graph theory was published by Leonhard Euler. However, he did not use the word ‘graph’ in his work. In the early stages of the development of the subject, the vertices of a graph were specified as , and the edges were denoted by, . In recent times, several resea

APA, Harvard, Vancouver, ISO, and other styles

23

Jeyanthi, P., A. Maheswari, and M, Vijaya-Laksmi. "Vertex Equitable Labeling of Cycle and Star Related Graphs." Journal of Scientific Research 7, no. 3 (2015): 33–42. http://dx.doi.org/10.3329/jsr.v7i3.22810.

Full text

Abstract:

Let G be a graph with p vertices and q edges and A = {0,1,2, ..,[q/2]} A vertex labeling f: V (G) ? A induces an edge labeling f* defined by f*(uv) = f(u) + f(v) for all edges uv. For ? ? A, let vf (a) be the number of vertices v with f(v) = a. A graph G is said to be vertex equitable if there exists a vertex labeling f such that for all a and b in A, |?f (?) - ?f (b)|? 1 and the induced edge labels are 1, 2, 3, , q. In this paper, we prove that jewel graph Jn, jelly fish graph (JF)n, balanced lobster graph BL(n,2,m), Ln ? Km (mean value) and <LnôK1,m> are vertex equitable graphs.

APA, Harvard, Vancouver, ISO, and other styles

24

Muhiuddin, G., A. M. Alanazi, A. R. Kannan, and V. Govindan. "Preservation of the Classical Meanness Property of Some Graphs Based on Line Graph Operation." Journal of Mathematics 2021 (March 13, 2021): 1–10. http://dx.doi.org/10.1155/2021/4068265.

Full text

Abstract:

In the present paper, we introduce the classical mean labeling of graphs and investigate their related properties. Moreover, it is obtained that the line graph operation preserves the classical meanness property for some standard graphs.

APA, Harvard, Vancouver, ISO, and other styles

25

Humaizah, R., Dafik, A. I. Kristiana, I. H. Agustin, and E. Y. Kurniawati. "On the resolving strong domination number of some wheel related graphs." Journal of Physics: Conference Series 2157, no. 1 (2022): 012015. http://dx.doi.org/10.1088/1742-6596/2157/1/012015.

Full text

Abstract:

Abstract This study aims to analyse the resolving strong dominating set. This concept combinations of two notions, they are metric dimension and strong domination set. By a resolving strong domination set, we mean a set D s ⊂ V(G) which satisfies the definition of strong dominating set as well as resolving set. The resolving strong domination number of graph G, denoted by γrst (G), is the minimum cardinality of resolving strong dominating set of G. In this paper, we determine the resolving strong domination number of some wheel related graphs, namely helm graph Hn , gear graph Gn , and flower

APA, Harvard, Vancouver, ISO, and other styles

26

R, Thayalarajan. "Some Results On κ -Relaxed Mean Graphs". International Journal of Mathematics Trends and Technology 66, № 7 (2020): 8–17. http://dx.doi.org/10.14445/22315373/ijmtt-v66i7p502.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

V. Prakash, R. Gopi, P. Shalini. "Anti Skolem Mean Labeling of Quardrilateral Snake Related Graphs." Tuijin Jishu/Journal of Propulsion Technology 44, no. 5 (2023): 495–500. http://dx.doi.org/10.52783/tjjpt.v44.i5.2512.

Full text

Abstract:

A graph with p vertices and q edges where is said to be an anti skolem mean graph if it is possible to label the vertices with distinct labels from in such a way that each edge e=uv is labelled with then the resulting edge labels are distinct labels from the set . In this case f is called an Anti Skolem Mean labelling of G.

APA, Harvard, Vancouver, ISO, and other styles

28

K. N. Babu. "Even Vertex Odd Edge Root Square Mean Labelling Of Path Related Graphs." Communications on Applied Nonlinear Analysis 32, no. 2s (2024): 296–303. https://doi.org/10.52783/cana.v32.2401.

Full text

Abstract:

Consider G be a graph with p vertices and q edges. A graph G is said to be even vertex odd edge root square mean labelling if there exist an injective map f :V(G)→{0,1,2,3,…,2q} such that the induced edge labels are odd and distinct which can be obtained by f^(* ) (e)=⌈√((〖f(u)〗^2 +〖f(v)〗^2)/2)⌉ or ⌊√((〖f(u)〗^2 +〖f(v)〗^2)/2)⌋. Any graph which admits even vertex odd edge root square mean labelling then it is called as even vertex odd edge root square mean labelling graph.

APA, Harvard, Vancouver, ISO, and other styles

29

S. Vani Shree. "Encryption and Decryption of Data Using Edge Bimagic Mean Labeling and Hill Cipher Technique." Advances in Nonlinear Variational Inequalities 28, no. 6s (2025): 53–63. https://doi.org/10.52783/anvi.v28.4118.

Full text

Abstract:

In the past few decades, a technology for encrypting and decrypting messages using the hill cipher crypto system and graph labeling technique has emerged. While considering two symmetric cipher types namely substitution cipher and transposition cipher, Hill cipher is a type of substitution cipher used for encrypting a group of letter. In this research, a labeling concept namely Edge Bimagic Mean Labeling has been introduced and it is substantiated for the ladder related graphs. The encryption process and the decryption process of a text using Hill cipher are also analyzed by making use of the

APA, Harvard, Vancouver, ISO, and other styles

30

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

31

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

32

Esakkimuthu, A. "Near Mean Labeling of Path Related Splitted Graphs." International Journal for Research in Applied Science and Engineering Technology 6, no. 4 (2018): 2252–58. http://dx.doi.org/10.22214/ijraset.2018.4384.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Dhanalakshmi, S., and N. Parvathi. "Mean Square Cordial Labeling on Star Related Graphs." Journal of Physics: Conference Series 1377 (November 2019): 012027. http://dx.doi.org/10.1088/1742-6596/1377/1/012027.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Erfani, Seyedeh Hamideh, та Reza Mortazavi. "A Novel Graph-modiﬁcation Technique for User Privacy-preserving on Social Networks". Journal of Telecommunications and Information Technology 3 (30 вересня 2019): 27–38. http://dx.doi.org/10.26636/jtit.2019.134319.

Full text

Abstract:

The growing popularity of social networks and the increasing need for publishing related data mean that protection of privacy becomes an important and challenging problem in social networks. This paper describes the (k,l k,l k,l)-anonymity model used for social network graph anonymization. The method is based on edge addition and is utility-aware, i.e. it is designed to generate a graph that is similar to the original one. Diﬀerent strategies are evaluated to this end and the results are compared based on common utility metrics. The outputs conﬁrm that the na¨ıve idea of adding some random or

APA, Harvard, Vancouver, ISO, and other styles

35

Britton, Tom, and Pieter Trapman. "Maximizing the Size of the Giant." Journal of Applied Probability 49, no. 4 (2012): 1156–65. http://dx.doi.org/10.1239/jap/1354716664.

Full text

Abstract:

Consider a random graph where the mean degree is given and fixed. In this paper we derive the maximal size of the largest connected component in the graph. We also study the related question of the largest possible outbreak size of an epidemic occurring ‘on’ the random graph (the graph describing the social structure in the community). More precisely, we look at two different classes of random graphs. First, the Poissonian random graph in which each node i is given an independent and identically distributed (i.i.d.) random weight Xi with E(Xi)=µ, and where there is an edge between i and j with

APA, Harvard, Vancouver, ISO, and other styles

36

Wang, Wenyuan, and Qiang Sun. "Robust Adaptive Estimation of Graph Signals Based on Welsch Loss." Symmetry 14, no. 2 (2022): 426. http://dx.doi.org/10.3390/sym14020426.

Full text

Abstract:

This paper considers the problem of adaptive estimation of graph signals under the impulsive noise environment. The existing least mean squares (LMS) approach suffers from severe performance degradation under an impulsive environment that widely occurs in various practical applications. We present a novel adaptive estimation over graphs based on Welsch loss (WL-G) to handle the problems related to impulsive interference. The proposed WL-G algorithm can efficiently reconstruct graph signals from the observations with impulsive noises by formulating the reconstruction problem as an optimization

APA, Harvard, Vancouver, ISO, and other styles

37

SALEZ, JUSTIN. "The Interpolation Method for Random Graphs with Prescribed Degrees." Combinatorics, Probability and Computing 25, no. 3 (2015): 436–47. http://dx.doi.org/10.1017/s0963548315000139.

Full text

Abstract:

We consider large random graphs with prescribed degrees, as generated by the configuration model. In the regime where the empirical degree distribution approaches a limit μ with finite mean, we establish the systematic convergence of a broad class of graph parameters that includes the independence number, the maximum cut size, the logarithm of the Tutte polynomial, and the free energy of the anti-ferromagnetic Ising and Potts models. Contrary to previous works, our results are not a priori limited to the free energy of some prescribed graphical model. They apply more generally to any additive,

APA, Harvard, Vancouver, ISO, and other styles

38

Sudhakar, S., Silviya Francis, and V. Balaji. "RELAXED MEAN LABELING FOR CORONA OF CYCLE AND STAR GRAPHS." Journal of Harmonized Research in Applied Science 7, no. 2 (2019): 49. http://dx.doi.org/10.30876/johr.7.2.2019.49-55.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

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

40

Annie lydia, A., and M. K. Angel Jebitha. "OPERATIONS ON SOME STAR RELATED PERFECT MEAN CORDIAL GRAPHS." Advances in Mathematics: Scientific Journal 9, no. 6 (2020): 4115–25. http://dx.doi.org/10.37418/amsj.9.6.93.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Ponraj, R., and S. Sathish Narayanan. "TOTAL MEAN CORDIAL LABELING OF SOME CYCLE RELATED GRAPHS." Journal of applied mathematics & informatics 33, no. 1_2 (2015): 101–10. http://dx.doi.org/10.14317/jami.2015.101.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Nicholas, T., and K. John Bosco. "Radio mean D-distance number of cycle-related graphs." International Journal of Mathematics Trends and Technology 40, no. 3 (2016): 247–51. http://dx.doi.org/10.14445/22315373/ijmtt-v40p530.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

moni, A. Pon, S. Navaneetha Krishnan, and A. Naga rajan. "Skolem Difference Lucas Mean Labeling for Star Related Graphs." International Journal of Mathematics Trends and Technology 62, no. 2 (2018): 104–9. http://dx.doi.org/10.14445/22315373/ijmtt-v62p515.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Shalini, P., and S. A. Meena. "Lehmer-4 Mean Labeling for some Path Related Graphs." Arya Bhatta Journal of Mathematics and Informatics 15, no. 1 (2023): 105–10. http://dx.doi.org/10.5958/2394-9309.2023.00015.x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Britton, Tom, and Pieter Trapman. "Maximizing the Size of the Giant." Journal of Applied Probability 49, no. 04 (2012): 1156–65. http://dx.doi.org/10.1017/s0021900200012948.

Full text

Abstract:

Consider a random graph where the mean degree is given and fixed. In this paper we derive the maximal size of the largest connected component in the graph. We also study the related question of the largest possible outbreak size of an epidemic occurring ‘on’ the random graph (the graph describing the social structure in the community). More precisely, we look at two different classes of random graphs. First, the Poissonian random graph in which each node i is given an independent and identically distributed (i.i.d.) random weight X i with E(X i )=µ, and where there is an edge between i and j w

APA, Harvard, Vancouver, ISO, and other styles

46

Selvaraj, Devipriya, Vijaya M S, and Krishnaveni Sakkarapani. "Improved half-maximal inhibitory concentration regression model using amyotrophic lateral sclerosis data." Bulletin of Electrical Engineering and Informatics 14, no. 3 (2025): 2276–87. https://doi.org/10.11591/eei.v14i3.8520.

Full text

Abstract:

The current research addresses the critical need for precise half-maximal inhibitory concentration regression in the neurodegenerative condition amyotrophic lateral sclerosis (ALS). Unavailable drug-induced gene expressions and irrelevant molecular descriptors have yielded regression models with less accuracy using traditional machine learning (ML). Drugs can be converted to graph format and integrated with gene expressions to learn drug-gene interactions better thereby producing precise half-maximal inhibitory concentration regression models. To accomplish this, three variants of graph neural

APA, Harvard, Vancouver, ISO, and other styles

47

Li, Xuexiang, Hansheng Yang, and Cong Yang. "ResE: A Fast and Efficient Neural Network-Based Method for Link Prediction." Electronics 12, no. 8 (2023): 1919. http://dx.doi.org/10.3390/electronics12081919.

Full text

Abstract:

In this study, we present a novel embedding model, named ResE, for predicting links in knowledge graphs. ResE employs depth-separable convolution and residual blocks, integrated with channel attention mechanisms. ResE surpasses previously published models, including the closely related TransE model, by achieving the satisfactory mean rank (MR) and the excellent Hits@10 scores on both WN18RR and FB15K-237 benchmarks. ResE is a promising model for knowledge graph completion tasks, with potential for further investigation and extension to new applications such as user-oriented relationship modeli

APA, Harvard, Vancouver, ISO, and other styles

48

Slagle, Ian T., Faisal M. Alamgir, and Victor Fung. "Active Learning for Atomic Structure Elucidation of Battery Cathodes." ECS Meeting Abstracts MA2025-01, no. 27 (2025): 1526. https://doi.org/10.1149/ma2025-01271526mtgabs.

Full text

Abstract:

Atomic structure determination through materials characterization is a common procedure in materials science research but is limited to techniques that can be simulated quickly, such as X-ray diffraction. However, these techniques are not sufficient to determine structure in all cases, particularly those that exhibit local disorder. For example, X-ray diffraction does not measure the non-cooperative Jahn-Teller distortions in the nickel environment in LiMO2 (M = Co, Ni, Mn), but extended X-ray absorption fine structure (EXAFS) does. While structural determination techniques such as reverse Mon

APA, Harvard, Vancouver, ISO, and other styles

49

Mariaraja, P., Hussein Z. Almngoshi, C. M. Hilda Jerlin, et al. "Lucky edge geometric mean labeling of graphs and applications in electrical networks." Journal of Discrete Mathematical Sciences and Cryptography 27, no. 7 (2024): 2133–41. http://dx.doi.org/10.47974/jdmsc-2086.

Full text

Abstract:

A Lucky Edge Geometric Mean Labeling (LEGML) is a function μ that assigns the integers to the vertices of graph G such that for every edge as ‘{E}’, uv∈E(G) there exists a function μ*:E(G) → N is defined by μ* (uv) = √μ(u)μ(v) (or) √μ(u)μ(v) with the state that μ* (uv) ≠ μ* (vw) whenever {u} and {vw} have a common vertex as {v}. A minor number ‘k→ E = {1, 2, 3 … k} is the LEGML of G and is signified by h¢GM(G). A result that accepts LEGML is the Lucky Edge Geometric Mean Graph (LEGMG). The idea of the Graph Theory (GT) concept is fused into the Electric Circuit (EC), and the related compli

APA, Harvard, Vancouver, ISO, and other styles

50

CSÖRGŐ, SÁNDOR, and WEI BIAO WU. "Random Graphs and the Strong Convergence of Bootstrap Means." Combinatorics, Probability and Computing 9, no. 4 (2000): 315–47. http://dx.doi.org/10.1017/s0963548300004296.

Full text

Abstract:

We consider graphs Gn generated by multisets [Iscr ]n with n random integers as elements, such that vertices of Gn are connected by edges if the elements of [Iscr ]n that the vertices represent are the same, and prove asymptotic results on the sparsity of edges connecting the different subgraphs Gn of the random graph generated by ∪∞n=1[Iscr ]n. These results are of independent interest and, for two models of the bootstrap, we also use them here to link almost sure and complete convergence of the corresponding bootstrap means and averages of related randomly chosen subsequences of a sequence o

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!