Log in

Relevant bibliographies by topics / D)-Mean Graph / Journal articles

To see the other types of publications on this topic, follow the link: D)-Mean Graph.

Journal articles on the topic 'D)-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 'D)-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

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

2

Sandhya, Labelling S. S., E. Ebin Raja Merly, and G. D. Jemi. "Some New Results on Super Heronian Mean." Journal of Mathematics Research 9, no. 1 (2017): 62. http://dx.doi.org/10.5539/jmr.v9n1p62.

Full text

Abstract:

Here we discuss on Some new results on Super Heronian Mean Labelling of graphs. For the present investigation on Qn ⨀ K1,D(Qn) ⨀ K1,Middle graph, Total graph, Ln ⨀ K1.We discuss briefly about the summary and the other valid information with appropriate graphs and definitions.

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

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

5

K.Sunitha. "Radial Radio Pell Mean Labeling of Subdivision of Graphs." Advances in Nonlinear Variational Inequalities 28, no. 2 (2024): 267–73. http://dx.doi.org/10.52783/anvi.v28.1969.

Full text

Abstract:

A one-one mapping ϕ : V (G) → N for a connected graph G is defined as follows: d(x,y)+⌈(ϕ(x)+2ϕ(y))/2⌉≥1+r(G), where radius is denoted by r(G). Any vertex in G has a radial radio pell mean number of ϕ which is the maximum number and is represented by rrpmn(ϕ). Here, we look at the labeling of various graphs using the radial radio pell mean of subdivisions such as subdivision of star graph S(K_(1,n)) , subdivision of path graph S(Pn) , subdivision of friendship graph S(Fn), subdivision of wheel graph S(Wn), subdivision of quadrilateral book graph S(QB(4,3)), subdivision of closed helm graph S(C

APA, Harvard, Vancouver, ISO, and other styles

6

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

7

S.S. Sandhya and H. Aswathy. "Some results on harmonic index of root square mean graphs." Malaya Journal of Matematik 8, no. 04 (2020): 2277–81. http://dx.doi.org/10.26637/mjm0804/0163.

Full text

Abstract:

The Harmonic index \(H(G)\) of a graph \(G\) is defined as the sum of weights \(\frac{2}{d(u)+d(v)}\) of all edges \(u v\) of \(G\), where \(d(u)\) denotes the degree of a vertex \(u\) in \(G\). In this paper, we introduce harmonic index of some root square mean graphs.

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

las, T. Nicho, K. John Bosco, and V. Vi ola. "On Radio Mean D-Distance Number of Graph Obtained from Graph Operation." International Journal of Mathematics Trends and Technology 58, no. 2 (2018): 98–106. http://dx.doi.org/10.14445/22315373/ijmtt-v58p514.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Draief, M., A. Ganesh, and L. Massoulié. "Exponential Random Graphs as Models of Overlay Networks." Journal of Applied Probability 46, no. 01 (2009): 199–220. http://dx.doi.org/10.1017/s0021900200005313.

Full text

Abstract:

In this paper we give an analytic solution for graphs with n nodes and E = cn log n edges for which the probability of obtaining a given graph G is µn (G) = exp (- β ∑i=1 n d i 2), where d i is the degree of node i. We describe how this model appears in the context of load balancing in communication networks, namely peer-to-peer overlays. We then analyse the degree distribution of such graphs and show that the degrees are concentrated around their mean value. Finally, we derive asymptotic results for the number of edges crossing a graph cut and use these results (i) to compute the graph expans

APA, Harvard, Vancouver, ISO, and other styles

11

Gul, Lubna, Gohar Ali, Usama Waheed, and Nudrat Aamir. "The Optimal Graph Whose Least Eigenvalue is Minimal among All Graphs via 1-2 Adjacency Matrix." Journal of Mathematics 2021 (November 17, 2021): 1–4. http://dx.doi.org/10.1155/2021/8016237.

Full text

Abstract:

All graphs under consideration are finite, simple, connected, and undirected. Adjacency matrix of a graph G is 0,1 matrix A = a i j = 0 , i f v i = v j o r d v i , v j ≥ 2 1 , i f d v i , v j = 1. . Here in this paper, we discussed new type of adjacency matrix known by 1-2 adjacency matrix defined as A 1,2 G = a i j = 0 , i f v i = v j o r d v i , v j ≥ 3 1 , i f d v i , v j = 2 , from eigenvalues of the graph, we mean eigenvalues of the 1-2 adjacency matrix. Let T n c be the set of the complement of trees of order n . In this paper, we characterized a unique graph whose least eigenvalue is mi

APA, Harvard, Vancouver, ISO, and other styles

12

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

13

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

14

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

15

Baskaran, Thamaraiselvi, and Rajasekaran Ganapathy. "A Study on C -Exponential Mean Labeling of Graphs." Journal of Mathematics 2022 (October 7, 2022): 1–7. http://dx.doi.org/10.1155/2022/2865573.

Full text

Abstract:

A function h is mentioned as a C -exponential mean labeling of a graph G V , E that has s vertices and r edges if h : V G ⟶ 1 , 2 , 3 , ⋯ , r + 1 is injective and the generated function h ∗ : E G ⟶ 2 , 3 , 4 , ⋯ , r + 1 defined by h ∗ a b = 1 / e h b h b / h a h a 1 / h b − h a , for all a b ∈ E G , is bijective. A graph which recognizes a C -exponential mean labeling is defined as C -exponential mean graph. In the following study, we have studied the exponential meanness of the path, the graph triangular tree of T n , C m P n , cartesian product of two paths P m ▫ P n , one-sided step graph o

APA, Harvard, Vancouver, ISO, and other styles

16

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

17

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

18

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

19

Hsu, Louis M., Judy Hayman, Judith Koch, and Debbie Mandell. "Relation of Statistically Significant, Abnormal, and Typical WAIS-R VIQ-PIQ Discrepancies to Full Scale IQs." European Journal of Psychological Assessment 16, no. 2 (2000): 107–14. http://dx.doi.org/10.1027//1015-5759.16.2.107.

Full text

Abstract:

Summary: In the United States' normative population for the WAIS-R, differences (Ds) between persons' verbal and performance IQs (VIQs and PIQs) tend to increase with an increase in full scale IQs (FSIQs). This suggests that norm-referenced interpretations of Ds should take FSIQs into account. Two new graphs are presented to facilitate this type of interpretation. One of these graphs estimates the mean of absolute values of D (called typical D) at each FSIQ level of the US normative population. The other graph estimates the absolute value of D that is exceeded only 5% of the time (called abnor

APA, Harvard, Vancouver, ISO, and other styles

20

ELrokh, Ashraf, Mohammed M. Ali Al-Shamiri, and Atef Abd El-hay. "A Novel Radio Geometric Mean Algorithm for a Graph." Symmetry 15, no. 3 (2023): 570. http://dx.doi.org/10.3390/sym15030570.

Full text

Abstract:

Radio antennas switch signals in the form of radio waves using different frequency bands of the electromagnetic spectrum. To avoid interruption, each radio station is assigned a unique number. The channel assignment problem refers to this application. A radio geometric mean labeling of a connected graph G is an injective function h from the vertex set, V(G) to the set of natural numbers N such that for any two distinct vertices x and y of G, h(x)·h(y)≥diam+1−d(x,y). The radio geometric mean number of h, rgmn(h), is the maximum number assigned to any vertex of G. The radio geometric mean number

APA, Harvard, Vancouver, ISO, and other styles

21

Méndez-Bermúdez, J. A., José M. Rodríguez, José L. Sánchez, and José M. Sigarreta. "Analytical and computational properties of the variable symmetric division deg index." Mathematical Biosciences and Engineering 19, no. 9 (2022): 8908–22. http://dx.doi.org/10.3934/mbe.2022413.

Full text

Abstract:

<abstract><p>The aim of this work is to obtain new inequalities for the variable symmetric division deg index $ SDD_\alpha(G) = \sum_{uv \in E(G)} (d_u^\alpha/d_v^\alpha+d_v^\alpha/d_u^\alpha) $, and to characterize graphs extremal with respect to them. Here, by $ uv $ we mean the edge of a graph $ G $ joining the vertices $ u $ and $ v $, and $ d_u $ denotes the degree of $ u $, and $ \alpha \in \mathbb{R} $. Some of these inequalities generalize and improve previous results for the symmetric division deg index. In addition, we computationally apply the $ SDD_\alpha(G) $ index on

APA, Harvard, Vancouver, ISO, and other styles

22

Badr, Elsayed, Shokry Nada, Mohammed M. Ali Al-Shamiri, Atef Abdel-Hay, and Ashraf ELrokh. "A Novel Mathematical Model for Radio Mean Square Labeling Problem." Journal of Mathematics 2022 (January 12, 2022): 1–9. http://dx.doi.org/10.1155/2022/3303433.

Full text

Abstract:

A radio mean square labeling of a connected graph is motivated by the channel assignment problem for radio transmitters to avoid interference of signals sent by transmitters. It is an injective map h from the set of vertices of the graph G to the set of positive integers N , such that for any two distinct vertices x , y , the inequality d x , y + h x 2 + h y 2 / 2 ≥ dim G + 1 holds. For a particular radio mean square labeling h , the maximum number of h v taken over all vertices of G is called its spam, denoted by rmsn h , and the minimum value of rmsn h taking over all radio mean square label

APA, Harvard, Vancouver, ISO, and other styles

23

Shao, Zehui, S. M. Sheikholeslami, Pu Wu, and Jia-Biao Liu. "The Metric Dimension of Some Generalized Petersen Graphs." Discrete Dynamics in Nature and Society 2018 (August 1, 2018): 1–10. http://dx.doi.org/10.1155/2018/4531958.

Full text

Abstract:

The distance d(u,v) between two distinct vertices u and v in a graph G is the length of a shortest (u,v)-path in G. For an ordered subset W={w1,w2,…,wk} of vertices and a vertex v in G, the code of v with respect to W is the ordered k-tuple cW(v)=(d(v,w1),d(v,w2),…,d(v,wk)). The set W is a resolving set for G if every two vertices of G have distinct codes. The metric dimension of G is the minimum cardinality of a resolving set of G. In this paper, we first extend the results of the metric dimension of P(n,3) and P(n,4) and study bounds on the metric dimension of the families of the generalized

APA, Harvard, Vancouver, ISO, and other styles

24

Aasi, Muhammad Shahbaz, Muhammad Asif, Tanveer Iqbal, and Muhammad Ibrahim. "Radio Labelings of Lexicographic Product of Some Graphs." Journal of Mathematics 2021 (December 7, 2021): 1–6. http://dx.doi.org/10.1155/2021/9177818.

Full text

Abstract:

Labeling of graphs has defined many variations in the literature, e.g., graceful, harmonious, and radio labeling. Secrecy of data in data sciences and in information technology is very necessary as well as the accuracy of data transmission and different channel assignments is maintained. It enhances the graph terminologies for the computer programs. In this paper, we will discuss multidistance radio labeling used for channel assignment problems over wireless communication. A radio labeling is a one-to-one mapping ℘ : V G ⟶ ℤ + satisfying the condition | ℘ μ − ℘ μ ′ | ≥ diam G + 1 − d μ , μ ′ :

APA, Harvard, Vancouver, ISO, and other styles

25

El Fal, Mohammed, Youssef Ramli, El Mokhtar Essassi, Mohamed Saadi, and Lahcen El Ammari. "Crystal structure of 4-allylsulfanyl-1H-pyrazolo[3,4-d]pyrimidine." Acta Crystallographica Section E Structure Reports Online 70, no. 9 (2014): o1038. http://dx.doi.org/10.1107/s1600536814018042.

Full text

Abstract:

In the title compound, C8H8N4S, the pyrazolo[3,4-d]pyrimidine ring system is essentially planar, with a maximum deviation from the mean plane of 0.025 (3) Å. The allyl group is disordered over two sites in a 0.512 (6):0.488 (6) ratio. In the crystal, molecules are linked by pairs of N—H...N hydrogen bonds, forming inversion dimers with anR22(8) graph-set motif.

APA, Harvard, Vancouver, ISO, and other styles

26

Margutti, Ana V. B., Jacqueline P. Monteiro, and José S. Camelo. "Reference distribution of the bioelectrical impedance vector in healthy term newborns." British Journal of Nutrition 104, no. 10 (2010): 1508–13. http://dx.doi.org/10.1017/s000711451000245x.

Full text

Abstract:

Bioelectrical impedance vector analysis (BIVA) is a new method that is used for the routine monitoring of the variation in body fluids and nutritional status with assumptions regarding body composition values. The aim of the present study was to determine bivariate tolerance intervals of the whole-body impedance vector and to describe phase angle (PA) values for healthy term newborns aged 7–28 d. This descriptive cross-sectional study was conducted on healthy term neonates born at a low-risk public maternity. General and anthropometric neonatal data and bioelectrical impedance data (800 μA–50

APA, Harvard, Vancouver, ISO, and other styles

27

Agustin, Ika Hesti, D. Dafik, and A. Y. Harsya. "On r-dynamic coloring of some graph operations." Indonesian Journal of Combinatorics 1, no. 1 (2016): 22. http://dx.doi.org/10.19184/ijc.2016.1.1.3.

Full text

Abstract:

Let $G$ be a simple, connected and undirected graph. Let $r,k$ be natural number. By a proper $k$-coloring of a graph $G$, we mean a map $ c : V (G) \rightarrow S$, where $|S| = k$, such that any two adjacent vertices receive different colors. An $r$-dynamic $k$-coloring is a proper $k$-coloring $c$ of $G$ such that $|c(N (v))| \geq min\{r, d(v)\}$ for each vertex $v$ in $V(G)$, where $N (v)$ is the neighborhood of $v$ and $c(S) = \{c(v) : v \in S\}$ for a vertex subset $S$ . The $r$-dynamic chromatic number, written as $\chi_r(G)$, is the minimum $k$ such that $G$ has an $r$-dynamic $k$-color

APA, Harvard, Vancouver, ISO, and other styles

28

Babai, László, and Mario Szegedy. "Local Expansion of Symmetrical Graphs." Combinatorics, Probability and Computing 1, no. 1 (1992): 1–11. http://dx.doi.org/10.1017/s0963548300000031.

Full text

Abstract:

A graph is vertex-transitive (edge-transitive) if its automorphism group acts transitively on the vertices (edges, resp.). The expansion rate of a subset S of the vertex set is the quotient e(S):= |∂(S)|/|S|, where ∂(S) denotes the set of vertices not in S but adjacent to some vertex in S. Improving and extending previous results of Aldous and Babai, we give very simple proofs of the following results. Let X be a (finite or infinite) vertex-transitive graph and let S be a finite subset of the vertices. If X is finite, we also assume |S| ≤|V(X)/2. Let d be the diameter of S in the metric induce

APA, Harvard, Vancouver, ISO, and other styles

29

MASSOPTIER, LAURENT, AVISHKAR MISRA, ARCOT SOWMYA, and SERGIO CASCIARO. "COMBINING GRAPH-CUT TECHNIQUE AND ANATOMICAL KNOWLEDGE FOR AUTOMATIC SEGMENTATION OF LUNGS AFFECTED BY DIFFUSE PARENCHYMAL DISEASE IN HRCT IMAGES." International Journal of Image and Graphics 11, no. 04 (2011): 509–29. http://dx.doi.org/10.1142/s0219467811004202.

Full text

Abstract:

Accurate and automated lung segmentation in high-resolution computed tomography (HRCT) is highly challenged by the presence of pathologies affecting lung parenchyma appearance and borders. The algorithm presented employs an anatomical model-driven approach and systematic incremental knowledge acquisition to produce coarse lung delineation, used as initialization for the graph-cut algorithm. The proposed method is evaluated on a 49 HRCT cases dataset including various lung disease patterns. The accuracy of the method is assessed using dice similarity coefficient (DSC) and shape differentiation

APA, Harvard, Vancouver, ISO, and other styles

30

Li, Linfeng, Peng Wang, Yao Wang, et al. "A Method to Learn Embedding of a Probabilistic Medical Knowledge Graph: Algorithm Development." JMIR Medical Informatics 8, no. 5 (2020): e17645. http://dx.doi.org/10.2196/17645.

Full text

Abstract:

Background Knowledge graph embedding is an effective semantic representation method for entities and relations in knowledge graphs. Several translation-based algorithms, including TransE, TransH, TransR, TransD, and TranSparse, have been proposed to learn effective embedding vectors from typical knowledge graphs in which the relations between head and tail entities are deterministic. However, in medical knowledge graphs, the relations between head and tail entities are inherently probabilistic. This difference introduces a challenge in embedding medical knowledge graphs. Objective We aimed to

APA, Harvard, Vancouver, ISO, and other styles

31

Tran, Huu Ngoc Tran, J. Joshua Thomas, and Nurul Hashimah Ahamed Hassain Malim. "DeepNC: a framework for drug-target interaction prediction with graph neural networks." PeerJ 10 (May 11, 2022): e13163. http://dx.doi.org/10.7717/peerj.13163.

Full text

Abstract:

The exploration of drug-target interactions (DTI) is an essential stage in the drug development pipeline. Thanks to the assistance of computational models, notably in the deep learning approach, scientists have been able to shorten the time spent on this stage. Widely practiced deep learning algorithms such as convolutional neural networks and recurrent neural networks are commonly employed in DTI prediction projects. However, they can hardly utilize the natural graph structure of molecular inputs. For that reason, a graph neural network (GNN) is an applicable choice for learning the chemical

APA, Harvard, Vancouver, ISO, and other styles

32

Lee, Jae Hong. "Reinterpreting Sustainable Architecture: What Does It Mean Syntactically?" Sustainability 12, no. 16 (2020): 6566. http://dx.doi.org/10.3390/su12166566.

Full text

Abstract:

How can sustainable architecture be described spatially? Is there any way of looking at sustainable architecture from a spatial perspective? This paper aims to explore whether a syntactical viewpoint would be an appropriate focus, and attempts to address how a configurational approach contributes to our understanding of sustainable architecture. To explore the possible theoretical framework in understanding sustainable architecture from a spatial perspective, three buildings (namely, Olympic House, SK Chemicals R&D, and the Epson Innovation Center), which are recognized as the most sustain

APA, Harvard, Vancouver, ISO, and other styles

33

Zhang, Liyang, Taihang Du, and Chundong Jiang. "Indoor 3-D Localization Based on Received Signal Strength Difference and Factor Graph for Unknown Radio Transmitter." Sensors 19, no. 2 (2019): 338. http://dx.doi.org/10.3390/s19020338.

Full text

Abstract:

Accurate localization of the radio transmitter is an important work in radio management. Previous research is more focused on two-dimensional (2-D) scenarios, but the localization of an unknown radio transmitter under three-dimensional (3-D) scenarios has more practical significance. In this paper, we propose a novel 3-D localization algorithm with received signal strength difference (RSSD) information and factor graph (FG), which is suitable for both line-of-sight (LOS) and non-line-of-sight (NLOS) condition. Considering the stochastic properties of measurement errors caused by the indoor env

APA, Harvard, Vancouver, ISO, and other styles

34

Ikeda, Nobutoshi. "Fractal behaviours of networks induced on infinite tree structures by random walks." Journal of Physics: Conference Series 2090, no. 1 (2021): 012085. http://dx.doi.org/10.1088/1742-6596/2090/1/012085.

Full text

Abstract:

Abstract Tree graphs such as Cayley trees provide a stage to support the self-organization of fractal networks by the flow of walkers from the root vertex to the outermost shell of the tree graph. This network model is a typical example that demonstrates the ability of a random process on a network to generate fractality. However, the finite scale of the tree structure assumed in the model restricts the size of fractal networks. In this study, we removed the restriction on the size of the trees by introducing a lifetime τ (number of steps of random walks) of walkers. As a result, we successful

APA, Harvard, Vancouver, ISO, and other styles

35

Ahlberg, Daniel. "Asymptotics of First-Passage Percolation on One-Dimensional Graphs." Advances in Applied Probability 47, no. 1 (2015): 182–209. http://dx.doi.org/10.1239/aap/1427814587.

Full text

Abstract:

In this paper we consider first-passage percolation on certain one-dimensional periodic graphs, such as the nearest neighbour graph for d, K ≥ 1. We expose a regenerative structure within the first-passage process, and use this structure to show that both length and weight of minimal-weight paths present a typical one-dimensional asymptotic behaviour. Apart from a strong law of large numbers, we derive a central limit theorem, a law of the iterated logarithm, and a Donsker theorem for these quantities. In addition, we prove that the mean and variance of the length and weight of minimizing path

APA, Harvard, Vancouver, ISO, and other styles

36

SOLTANI, HOSSEIN, and MANOUCHEHR ZAKER. "ON DYNAMIC MONOPOLIES OF GRAPHS WITH PROBABILISTIC THRESHOLDS." Bulletin of the Australian Mathematical Society 90, no. 3 (2014): 363–75. http://dx.doi.org/10.1017/s0004972714000604.

Full text

Abstract:

AbstractLet $\def \xmlpi #1{}\def \mathsfbi #1{\boldsymbol {\mathsf {#1}}}\let \le =\leqslant \let \leq =\leqslant \let \ge =\geqslant \let \geq =\geqslant \def \Pr {\mathit {Pr}}\def \Fr {\mathit {Fr}}\def \Rey {\mathit {Re}}G$ be a graph and ${{\tau }}$ be an assignment of nonnegative thresholds to the vertices of $G$. A subset of vertices, $D$, is an irreversible dynamic monopoly of $(G, \tau )$ if the vertices of $G$ can be partitioned into subsets $D_0, D_1, \ldots, D_k$ such that $D_0=D$ and, for all $i$ with $0 \leq i \leq k-1$, each vertex $v$ in $D_{i+1}$ has at least $\tau (v)$ neigh

APA, Harvard, Vancouver, ISO, and other styles

37

Rimoli, Michelle Ferreira da Silva, Roberta Martins Nogueira, Pryscila Machado de Catro, et al. "New alternative for adsorption of 2,4-dichlorophenoxyacetic acid herbicide (2,4-D)." Bioscience Journal 39 (August 18, 2023): e39091. http://dx.doi.org/10.14393/bj-v39n0a2023-64440.

Full text

Abstract:

The adsorptive capacity of charcoal from the husk of the brazil nut fruit, called “ouriço” (the hard ball with nuts inside) for the herbicide dichlorophenoxyacetic acid (2,4-D) was evaluated. Activated carbons were produced from the brazil nut in a tubular oven at 800 °C and activated with CO2 or water steam. The specific surface area was determined by the Brunauer, Emmett and Teller (BET) method, demonstrating the mean density of micropores. Analysis of N2 adsorption/desorption isotherms was undertaken and the morphology of activated carbons was visualized by Scanning Microscopy (SEM). The ac

APA, Harvard, Vancouver, ISO, and other styles

38

Jagadeesan, G., K. Sethusankar, R. Prasanna, and R. Raghunathan. "Ethyl 7′-(6-benzyloxy-2,2-dimethyltetrahydrofuro[3,2-d][1,3]dioxol-5-yl)-2-oxo-5′,6′,7′,7a'-tetrahydro-1′H,2H-spiro[acenaphthylene-1,5′-pyrrolo[1,2-c][1,3]thiazole]-6′-carboxylate." Acta Crystallographica Section E Structure Reports Online 68, no. 8 (2012): o2505—o2506. http://dx.doi.org/10.1107/s1600536812032291.

Full text

Abstract:

In the title compound, C34H35NO7S, the acenaphthylene unit is essentially planar (r.m.s. deviation = 0.0335 Å). The pyrrolothiazole ring system is folded about the bridging N—C bond; the thiazolidine and pyrrolidine rings adopt S- and C-envelope conformations, respectively, with a `butterfly' angle between the mean planes of 51.38 (10)°. The dioxolane and tetrahydrofuran rings adopt O- and a C-envelope conformations, respectively, with a `butterfly' angle between the mean planes of 57.12 (10)°. Two C atoms are each disordered over two positions with site-occupancy factors of 0.450 (7) and 0.55

APA, Harvard, Vancouver, ISO, and other styles

39

Wang, Zeyu, Jinlong Ma, Run Hu, and Xiaobing Luo. "Predicting lattice thermal conductivity of semiconductors from atomic-information-enhanced CGCNN combined with transfer learning." Applied Physics Letters 122, no. 15 (2023): 152106. http://dx.doi.org/10.1063/5.0142150.

Full text

Abstract:

Rapid identification of lattice thermal conductivity of semiconductors from their crystal structure is required in the discovery of functional materials. A promising strategy is using a machine learning method based on a first-principles dataset, which, however, suffers from the dilemma of too little data available. In this work, the crystal graph convolutional neural networks (CGCNN) model was improved by enhancing the information of atomic descriptors (for short CGCNN-D), and the transfer learning (TL) method was combined to overcome the problem of small datasets. It is found that the CGCNN-

APA, Harvard, Vancouver, ISO, and other styles

40

Asdinar, Asdinar, A. R. Pratiwi Hasanuddin, and Jusriani Jusriani. "Results of Internal Quality Assurance for Ureum Parameters at H. Andi Sulthan Daeng Radja Hospital." Journal of Multidiscipline and Collaboration Research 1, no. 2 (2024): 99–107. https://doi.org/10.58740/jmcr.v1i2.284.

Full text

Abstract:

Internal Quality Assurance (PMI) is a preventive and supervisory activity in the laboratory to ensure precise and accurate examination results. This study aims to evaluate the precision, accuracy, and types of analytical errors in PMI urea parameters in the laboratory of H. Andi Sulthan Daeng Radja Hospital, Bulukumba Regency. This descriptive study uses a mixed method with secondary data from PMI results for October–December 2023. The results showed that the average (Mean) urea value in October was 35.53 mg/dL, SD 1.77 mg/dL, CV 4.99%, and d 0.77%; November 35.48 mg/dL, SD 1.74 mg/dL, CV 4.89

APA, Harvard, Vancouver, ISO, and other styles

41

Umaru, Isaac John, Mary Athanasius Udoh, Tensaba Andes Akafa, et al. "Effect of Aqueous Extract of Achyranthes aspera Leaves on Antiretroviral Drug-Induced Hepatotoxicity in Rats." African Journal of Biochemistry and Molecular Biology Research 2, no. 2 (2025): 105–24. https://doi.org/10.58578/ajbmbr.v2i2.5183.

Full text

Abstract:

Achyranthes aspera leaves are believed to reverse drug resistance and increase the efficacy of current drugs. Achyranthes aspera leaves contain many secondary metabolites needed for the redressal of diseases and ailment. Thus, the ART-induced hepatotoxicity in rats. Methodology: Thirty (30) albino rats were divided into 5 groups of 6 each and treated as follows: Group A (no antiretroviral drugs, no extract); group B (antiretroviral drugs alone); group C (extract alone); group D (antiretroviral drug plus 40 mg/kg extract); group E (antiretroviral drug plus 80 mg/kg extract). All treatment laste

APA, Harvard, Vancouver, ISO, and other styles

42

Li, Yan Ru. "Discussions of Tire Ground Pressure Distribution Model." Advanced Materials Research 243-249 (May 2011): 4356–59. http://dx.doi.org/10.4028/www.scientific.net/amr.243-249.4356.

Full text

Abstract:

Though there have been some experimental studies to discuss laws of grounding shape and grounding pressure, the acknowledged mathematics model has not established. In order to discuss the law of tire ground pressure distribution, pressure distribution models of round rectangles grounding shape and ellipse grounding shape are advanced differently. Parameters setting method and 3-D graph of different ground pressure distribution are presented, and expressions of ground area, mean ground pressure, most ground pressure and the normal stress on the ground are deduced. Results show that the groundin

APA, Harvard, Vancouver, ISO, and other styles

43

Deng, Alan Y., Julie Dutil, Denis deBlois, and Johanne Tremblay. "Mapping of Two Quantitative Trait Loci (QTL) for Blood Pressure (BP) on Rat Chromosome (CHR.) 2 Using Congenic Strains by Telemetry." Hypertension 36, suppl_1 (2000): 718–19. http://dx.doi.org/10.1161/hyp.36.suppl_1.718-d.

Full text

Abstract:

P141 We previously mapped a BP QTL on rat Chr. 2 near the Na,K-ATPase ( Atp1a1) locus in two congenic strains. In the strain, S.MNS- Adh / D2Mit5, the Dahl salt sensitive (S) Chr. region, which was replaced by that of the Milan normotensive (MNS) strain, was quite large (roughly 80 cM). Now, we made 6 substrains from the original S.MNS- Adh / D2Mit5 strain, and then measured BP by telemetry for two (and will continue to measure for the rest) substrains. These two substrains do not contain overlapping chromosome regions. One, S.MNS-D2Mit6 / D2Rat166 (S.MNS1) , encompasses the angiotensin recept

APA, Harvard, Vancouver, ISO, and other styles

44

Sturgeon, Jonathan P., Michaela A. Mayhew, Janet Campbell, and Fenella M. Willis. "Automated Erythrocytapheresis in Sickle Cell Disease: Impact On Hospital Admission Rate and Iron Loading." Blood 114, no. 22 (2009): 1522. http://dx.doi.org/10.1182/blood.v114.22.1522.1522.

Full text

Abstract:

Abstract Abstract 1522 Poster Board I-545 INTRODUCTION Red cell exchange in sickle cell disease (SCD) reduces the risk of life threatening complications including acute chest syndrome, and thromboembolic stroke. Reduction in Hb S to less than 30% reduces overall blood viscosity and improves tissue oxygenation. With treatment being life-long, concerns over iron loading, patient compliance, blood-bourne infections, and cost could temper its effectiveness. METHODS/SUBJECTS A retrospective study of 74 patients with SCD (mean age 37.5, range 19-73) on automated red cell exchange (mean 21.3 exchange

APA, Harvard, Vancouver, ISO, and other styles

45

Ying, Xiang, Keke Zhao, Zhiqiang Liu, et al. "Wind Speed Prediction via Collaborative Filtering on Virtual Edge Expanding Graphs." Mathematics 10, no. 11 (2022): 1943. http://dx.doi.org/10.3390/math10111943.

Full text

Abstract:

Accurate and stable wind speed prediction is crucial for the safe operation of large-scale wind power grid connections. Existing methods are typically limited to a certain fixed area when learning the information of the wind speed sequence, which cannot make full use of the spatiotemporal correlation of the wind speed sequence. To address this problem, in this paper we propose a new wind speed prediction method based on collaborative filtering against a virtual edge expansion graph structure in which virtual edges enrich the semantics that the graph can express. It is an effective extension of

APA, Harvard, Vancouver, ISO, and other styles

46

Teixeira, Mayla Kezy Silva, Mariana Ribeiro de Moraes Rego, Marcelo Ferreira Torres da Silva, Eduardo José Veras Lourenço, Carlos Marcelo Figueredo, and Daniel Moraes Telles. "Bacterial Profile and Radiographic Analysis Around Osseointegrated Implants with Morse Taper and External Hexagon Connections: Split-Mouth Model." Journal of Oral Implantology 45, no. 6 (2019): 469–73. http://dx.doi.org/10.1563/aaid-joi-d-18-00222.

Full text

Abstract:

The aim of this clinical study was to evaluate bacterial colonization, marginal bone loss, and optical alveolar density in implants with Morse taper (MT) and external hexagon (EH) connections. Thirty-five implants were installed in 7 patients (mean age: 65.8 ± 6.7 years). Implants were divided into 2 groups, according to platform design: G1 - MT, installed 2mm infra-osseous and G2 - EH, positioned according to Branemark protocol. Patients were evaluated at baseline (T0), 21 days (T1), 3 months (T2), 6 months (T3), and 12 months (T4) after installations. Bone loss and alveolar density were eval

APA, Harvard, Vancouver, ISO, and other styles

47

Zamin Abdulhusssein Al-Sarray, Raghad Hassan Hussein, Ali Hussein Al-Hafidh, and Izzat Abdulsatar Al-Rayahi. "The relationship between vitamin D status and disease activity in Iraqi systemic lupus erythematosus patients." Journal of the Pakistan Medical Association 74, no. 10 (Supple-08) (2024): S176—S180. http://dx.doi.org/10.47391/jpma-bagh-16-39.

Full text

Abstract:

Objective: To find the relationship between vitamin D deficiency and the activity of systemic lupus erythematosusin Iraqi patients. Method: The case-control study was conducted at Baghdad Teaching Hospital, Baghdad, Iraq, from July to October2018, and comprised systemic lupus erythematosus patients regardless of age and gender visiting theRheumatology outpatient clinic. Serum levels of complement protein 3, complement protein 4, anti-doublestrandeddeoxyribonucleic acid and 25-hydroxy vitamin D were estimated. Based on disease activity scores, patientswere divided into moderate activity group S

APA, Harvard, Vancouver, ISO, and other styles

48

Murthy, Rudra, and Veershetty Gumtapure. "T-history analysis of aspect ratio effect on subcooling and solidification behaviour of phase change material in vertical glass tubes." Thermal Science, no. 00 (2020): 326. http://dx.doi.org/10.2298/tsci200509326m.

Full text

Abstract:

The study deals with the effect of the tube aspect ratio on subcooling and the solidification behavior of phase change material (PCM) using the T-history method (THM) and is compared with the differential scanning calorimetry (DSC) analysis. Three tubes of different aspect ratios (l/d) and a constant length of 178 mm are chosen for this study. Infrared (I.R.) contour depicts that the inner surface of the glass tube and PCM initiate heterogeneous nucleation. The DSC heat flow graph indicates a higher degree of subcooling (DOS) than THM. The study of aspect ratio with and without insulation show

APA, Harvard, Vancouver, ISO, and other styles

49

Rukayah, Rukayah, Achmad Tolla, and Ramly Ramly. "The Development of Writing Poetry Teaching Materials Based on Audiovisual Media of Fifth Grade Elementary School in Bone Regency." Journal of Language Teaching and Research 9, no. 2 (2018): 358. http://dx.doi.org/10.17507/jltr.0902.18.

Full text

Abstract:

The purpose of this research is to create the teaching material prototype which is valid, practical, and effective used in learning, especially in writing poetry of fifth grade elementary school in Bone regency. This study uses research and development method. The development model used is the Four-D models that include the definition (define), design, development (develop), and dissemination (disseminate). The design measures used in research and development (R&D) is pretest-posttest design. The data collection techniques used are observation, questionnaires, interviews, tests, and docume

APA, Harvard, Vancouver, ISO, and other styles

50

Mahapatra, Bibhupada, Aurobinda Chinara, and Prasanta Purohit. "A comparative analysis of total haemoglobin level and red blood cells count in ABO blood groups of healthy adults." International Journal of Research in Medical Sciences 7, no. 11 (2019): 4326. http://dx.doi.org/10.18203/2320-6012.ijrms20195010.

Full text

Abstract:

Background: The haemoglobin content and red blood cells counts in four different ABO blood groups in healthy adults remain conflicting with different results. The present study was undertaken to analyse the possible differences in the haemoglobin content and red blood cell counts in health adults in four ABO blood groups.Methods: This prospective study was undertaken in a tertiary health care facility. A total of 227 healthy students were finally included in this study for analysis. The study subjects were belonging to 18-22 years old of both genders. The haemoglobin content was measured by Sa

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!