Log in

Relevant bibliographies by topics / D)-Mean Graph

Contents

Journal articles
Dissertations / Theses
Book chapters
Conference papers

Academic literature 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 lists of relevant articles, books, theses, conference reports, and other scholarly sources 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.

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

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

More sources

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

1

Rasul, Kashif [Verfasser]. "Slow convergence of graphs under mean curvature flow / Kashif Rasul." Berlin : Freie Universität Berlin, 2010. http://d-nb.info/1024006441/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Vulcanov, Valentina Mira [Verfasser]. "Mean curvature flow of graphs with free boundaries / Valentina Mira Vulcanov." Berlin : Freie Universität Berlin, 2011. http://d-nb.info/1025355970/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Kapetanopoulos, Tobias [Verfasser], Amin [Akademischer Betreuer] Coja-Oghlan, Amin [Gutachter] Coja-Oghlan, and Nicola [Gutachter] Kistler. "The replica symmetric phase in diluted mean-field models and the sharp threshold for jigsaw percolation in random graphs / Tobias Kapetanopoulos ; Gutachter: Amin Coja-Oghlan, Nicola Kistler ; Betreuer: Amin Coja-Oghlan." Frankfurt am Main : Universitätsbibliothek Johann Christian Senckenberg, 2019. http://d-nb.info/119312607X/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Bode, Joshua Stephen [Verfasser]. "Mean curvature flow of cylindrical graphs / von Joshua Stephen Bode." 2007. http://d-nb.info/988611155/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "D)-Mean Graph"

1

Di Zio, Simone. "Reducing inconsistency in AHP by combining Delphi and Nudge theory and network analysis of the judgements: an application to future scenarios." In Proceedings e report. Firenze University Press, 2021. http://dx.doi.org/10.36253/978-88-5518-461-8.17.

Full text

Abstract:

The Analytic Hierarchy Process (AHP) is a Multi-Criteria method in which a number of decision factors (typically criteria and alternatives) are compared pairwise by one or more experts, using the Saaty scale, with the goal of sorting the alternatives (Saaty, 1977; 1980). For group AHP the Delphi method can be used in parallel with the AHP (Di Zio and Maretti, 2014), and this allows the search for a consensus on each pairwise judgement. A big issue of the AHP regards the inconsistency of the pairwise comparison matrices and here we propose a new method to reduce the inconsistency. As a solution

APA, Harvard, Vancouver, ISO, and other styles

2

"Bach’s Little Prelude No. 5 in D Minor, BWV926." In Der Tonwille, edited by Heinrich Schenker and William Drabkin. Oxford University PressNew York, NY, 2004. http://dx.doi.org/10.1093/oso/9780195122374.003.0026.

Full text

Abstract:

Abstract We encounter f 1 (see the graph of the Urlinie, p. 181, and Fig. 1f) for the first time in bar 7, where it concludes the first descending third-progression: henceforth, f1 remains the boundary of all the subsequent descending progressions as well—see bars 20,25,35,39 (43), and finally bar 48 (here raised through modal mixture, of course). Whatever any of these progressions in the inner or upper voice might mean, the same goal, f1, striven for and attained so many times, develops a significance in response to which we must recognize 3ˆ as the starting point of the Urlinie, contrary to

APA, Harvard, Vancouver, ISO, and other styles

3

Tanasa, Adrian. "The Sachdev–Ye–Kitaev (SYK) holographic model." In Combinatorial Physics. Oxford University Press, 2021. http://dx.doi.org/10.1093/oso/9780192895493.003.0015.

Full text

Abstract:

In this chapter, we first review the Sachdev–Ye–Kitaev (SYK) model, which is a quantum mechanical model of N fermions. The model is a quenched model, which means that the coupling constant is a random tensor with Gaussian distribution. The SYK model is dominated in the large N limit by melonic graphs, in the same way the tensor models presented in the previous three chapters are dominated by melonic graphs. We then present a purely graph theoretical proof of the melonic dominance of the SYK model. It is this property which led E. Witten to relate the SYK model to the coloured tensor model. In

APA, Harvard, Vancouver, ISO, and other styles

4

Kundu, Madhumita, Pekka Parviainen, and Saket Saurabh. "Discovering Bayesian Networks when Few Variables Matter." In Frontiers in Artificial Intelligence and Applications. IOS Press, 2024. http://dx.doi.org/10.3233/faia240846.

Full text

Abstract:

Learning the structure of a Bayesian network from data is one of the key problems in probabilistic graphical models. Unfortunately, the problem is NP-hard and this has motivated recent works where the problem has been studied from the perspective of algorithmic paradigms meant for coping with hardness, such as parameterized complexity. We contribute to this area by designing fixed parameter tractable algorithms (FPT) to learn the Bayesian network structure when only a few variables are important. In particular, we study score-based structure learning where each graph is given with a score, bas

APA, Harvard, Vancouver, ISO, and other styles

5

Moran, Gadi. "Phase Transition via Cellular Automata." In New Constructions in Cellular Automata. Oxford University Press, 2003. http://dx.doi.org/10.1093/oso/9780195137170.003.0017.

Full text

Abstract:

The dynamics of unit-charged graphs under iterated local majority rule observed in Moran [2] strongly suggested to me a phase-transition phenomenon. In a correspondence with D. Ruelle on this matter in late 1993, he expressed his feelings that the connection was too vague and that temperature was absent in it. This note is a reproduction of my 1993 response, where I try to force my suggestive feelings into a bit more formal frame. A recent work of Yuval Ginosar and Ron Holzman [1], which extends Moran [2], allows us to replace the definition of a solid, given in section 4, by a sharper one, na

APA, Harvard, Vancouver, ISO, and other styles

6

Hammer, Eric, and Norman Danner. "Towards a Model Theory of Venn Diagrams." In Logical Reasoning with Diagrams. Oxford University Press, 1996. http://dx.doi.org/10.1093/oso/9780195104271.003.0010.

Full text

Abstract:

One of the goals of logical analysis is to construct mathematical models of various practices of deductive inference. Traditionally, this is done by means of giving semantics and rules of inference for carefully specified formal languages. While this has proved to be an extremely fruitful line of analysis, some facets of actual inference are not accurately modeled by these techniques. The example we have in mind concerns the diversity of types of external representations employed in actual deductive reasoning. Besides language, these include diagrams, charts, tables, graphs, and so on. When th

APA, Harvard, Vancouver, ISO, and other styles

7

Li, Bin, and Dennis Shasha. "A Framework for Biological Pattern Discovery on Networks of Workstations." In Pattern Discovery in Biomolecular Data. Oxford University Press, 1999. http://dx.doi.org/10.1093/oso/9780195119404.003.0015.

Full text

Abstract:

Biological pattern discovery problems are computationally expensive. A possible technique for reducing the time to perform pattern discovery is parallelization. Since each task in a biological pattern discovery application is usually time-consuming by itself, we might be able to use networks of workstations (NOWs) that communicate infrequently. Persistent Linda (PLinda) is a distributed parallel computing system that runs on NOWs and it automatically utilizes idle workstations (Anderson and Shasha, 1992; Jeong, 1996). This means that labs can do parallel pattern discovery without buying new ha

APA, Harvard, Vancouver, ISO, and other styles

8

Hardin, Garrett. "Growth: Real and Spurious." In Living within Limits. Oxford University Press, 1993. http://dx.doi.org/10.1093/oso/9780195078114.003.0012.

Full text

Abstract:

One of the Rothschilds is credited with saying that "Compound interest is the eighth wonder of the world." How so? Because interest makes money grow, supposedly without limit. Ecologists regard the claim as arrant nonsense, for it implies a denial of Epicurean conservation. Like putative records of lifeless money in savings banks, real populations of living organisms grow by compound interest, but this biological reality does not move scientists to reverence. Biologists know that the growth of animals or plants does not violate conservation principles; biological growth merely involves the tra

APA, Harvard, Vancouver, ISO, and other styles

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

1

Kim, Hyeun Min, and Hee Cheon No. "Analysis of Power Spectrum Density in the PWR Fuel Assembly Using the 3-D LES Turbulent Model of Fluent 6." In 12th International Conference on Nuclear Engineering. ASMEDC, 2004. http://dx.doi.org/10.1115/icone12-49297.

Full text

Abstract:

Trublence-induced vibration is an important concern in the design of the spacer grids of nuclear power plants. This study addresses numerically and statistically the effects of random pressures due to turbulent flows upon the fluctuating responses to the power spectrum density in one-dimensional nuclear fuel rod supported simply by the spacer grids. The dynamic forces produced by the pressure fluctuation on the rod surface are calculated by the 3-dimensional large eddy simulation turbulent model in Fluent 6 to simulate the flow field in the same as being measured empirically via pressure trans

APA, Harvard, Vancouver, ISO, and other styles

2

Suresh, M., and V. Mohanaselvi. "Mean vertex D-distance for radial and detour radial graphs." In THE 11TH NATIONAL CONFERENCE ON MATHEMATICAL TECHNIQUES AND APPLICATIONS. AIP Publishing, 2019. http://dx.doi.org/10.1063/1.5112314.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Lucero, Briana M., and Matthew J. Adams. "A Statistical Approach to Ranking Similarities of Three Function Structure Groups Using Directed Graphs." In ASME 2018 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2018. http://dx.doi.org/10.1115/detc2018-86090.

Full text

Abstract:

Prior efforts in the study of engineering design employed various approaches to decompose product design. Design engineers use functional representation, and more precisely function structures, to define a product’s functionality. However, significant barriers remain to objectively quantifying the similarity between two function structures, even for the same product when developed by multiple designers. For function-structure databases this means that function-structures are implicitly categorized leaving the possibility of incorrect categorization and reducing efficacy of returned analogous c

APA, Harvard, Vancouver, ISO, and other styles

4

Karalus, Megan F., K. Boyd Fackler, Igor V. Novosselov, John C. Kramlich, and Philip C. Malte. "A Skeletal Mechanism for the Reactive Flow Simulation of Methane Combustion." In ASME Turbo Expo 2013: Turbine Technical Conference and Exposition. American Society of Mechanical Engineers, 2013. http://dx.doi.org/10.1115/gt2013-95904.

Full text

Abstract:

A skeletal mechanism for the prediction of NOx emissions from methane combustion at gas turbine conditions is developed in the present work. The goal is a mechanism that can be used in computational fluid dynamic modeling of lean premixed (LPM) combustors. A database of solutions from 0-D, adiabatic, homogeneous reactors (PSRs) is computed using CHEMKINPRO [1] over a parameter space chosen to include pressures from 1 to 30 atm, equivalence ratios from 0.4 to 1.0, and mean PSR residence times from slightly greater than blowout to 3ms. A resisidence time of 3 ms represents a useful maximum for t

APA, Harvard, Vancouver, ISO, and other styles

5

Rodriguez, Ivan D., Blai Bonet, Javier Romero, and Hector Geffner. "Learning First-Order Representations for Planning from Black Box States: New Results." In 18th International Conference on Principles of Knowledge Representation and Reasoning {KR-2021}. International Joint Conferences on Artificial Intelligence Organization, 2021. http://dx.doi.org/10.24963/kr.2021/51.

Full text

Abstract:

Recently Bonet and Geffner have shown that first-order representations for planning domains can be learned from the structure of the state space without any prior knowledge about the action schemas or domain predicates. For this, the learning problem is formulated as the search for a simplest first-order domain description D that along with information about instances I_i (number of objects and initial state) determine state space graphs G(P_i) that match the observed state graphs G_i where P_i = (D, I_i). The search is cast and solved approximately by means of a SAT solver that is called over

APA, Harvard, Vancouver, ISO, and other styles

6

Cayeux, Eric, John Macpherson, Dimitrios Pirovolou, Moray Laing, and Fred Florence. "A General Framework to Describe Drilling Process States." In SPE/IADC International Drilling Conference and Exhibition. SPE, 2023. http://dx.doi.org/10.2118/212537-ms.

Full text

Abstract:

Abstract Automation and digitalization of drilling requires shared knowledge about the state of the drilling process: is the bit on-bottom drilling or is the driller making a connection; is the borehole in good condition or is it sloughing? Yet there is no shared, clear and usable definition of what a drilling process state is, nor an agreed method to calculate it. In this paper, we propose a method to clarify the concept of drilling process state. A set of partial differential equations, respecting boundary conditions, can describe drilling operations. The set of all possible discrete changes

APA, Harvard, Vancouver, ISO, and other styles

7

Kiamilev, F., R. Paturi, S. Esener, Y. Fainman, and S. H. Lee. "Programmable optoelectronic multiprocessor vs symbolic substitution for digital optical computing." In OSA Annual Meeting. Optica Publishing Group, 1988. http://dx.doi.org/10.1364/oam.1988.mt5.

Full text

Abstract:

There is much interest in recent literature in employing symbolic substitution (SS) for general-purpose digital optical computing. We evaluate and compare the SS with the programmable optoelectronic multiprocessors (POEMs) paradigms currently under development at UCSD. First, we discovered that the computational ability of an optical SS system (without straightforward global interconnect) is essentially equivalent to a 2-D VLSI SIMD mesh connected array of small-grain processors. We can show that a SS rule can be simulated by a mesh of electronic processors using only a small number of cycles

APA, Harvard, Vancouver, ISO, and other styles

8

Bai, Yun, Liyun Fan, Xiaolu Dong, Xiuzhen Ma, and Enzhe Song. "Fuel Injection Quantity Fluctuation Prediction of Common Rail System Based on Bond Graph Model." In ASME 2015 Internal Combustion Engine Division Fall Technical Conference. American Society of Mechanical Engineers, 2015. http://dx.doi.org/10.1115/icef2015-1070.

Full text

Abstract:

Common rail injection system (CRIS) is an advanced technology which meets the stringent emission standards of diesel engines and satisfies consumer demand for better fuel efficiency and increased power. The coherence of fuel injection quantity is the key injection characteristic for CRIS to match diesel engines successfully. As a critical component for CRIS, the variation of injector characteristic parameters has significant influence on the coherence of fuel injection quantity of the system. In this paper, combining numerical modeling and design of experiments, the response predicted relation

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!