Relevant bibliographies by topics / Relaxed mean graph

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

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

Journal articles on the topic "Relaxed mean graph"

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 &nbsp;where &nbsp;is a relaxed skolem mean graph if&nbsp; ꞵ - &alpha;<sub>1 &ndash;&nbsp;</sub>&alpha;<sub>2 &ndash;&nbsp;</sub>&alpha;<sub>3 =&nbsp;</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 &ndash; star graph G = K1,&alpha; &cup; K1,&alpha; &cup; K1,&alpha; &cup; K1, &beta; &cup; K1, &beta; 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 &ndash; star graph 3 G = K1,&alpha; K1,&alpha; K1,&alpha; K1,&beta; K1,&beta; K1,&beta; 1 2 3 1 2 &cup; &cup; &cup; &cup; &cup; 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
More sources

Dissertations / Theses on the topic "Relaxed mean graph"

1

Wang, Yanfei. "Fuzzy methods for analysis of microarrays and networks." Thesis, Queensland University of Technology, 2011. https://eprints.qut.edu.au/48175/1/Yanfei_Wang_Thesis.pdf.

Full text
Abstract:
Bioinformatics involves analyses of biological data such as DNA sequences, microarrays and protein-protein interaction (PPI) networks. Its two main objectives are the identification of genes or proteins and the prediction of their functions. Biological data often contain uncertain and imprecise information. Fuzzy theory provides useful tools to deal with this type of information, hence has played an important role in analyses of biological data. In this thesis, we aim to develop some new fuzzy techniques and apply them on DNA microarrays and PPI networks. We will focus on three problems: (1) c
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Relaxed mean graph"

1

Olshanski, Grigori. Enumeration of maps. Edited by Gernot Akemann, Jinho Baik, and Philippe Di Francesco. Oxford University Press, 2018. http://dx.doi.org/10.1093/oxfordhb/9780198744191.013.26.

Full text
Abstract:
This article discusses the relationship between random matrices and maps, i.e. graphs drawn on surfaces, with particular emphasis on the one-matrix model and how it can be used to solve a map enumeration problem. It first provides an overview of maps and related objects, recalling the basic definitions related to graphs and defining maps as graphs embedded into surfaces before considering a coding of maps by pairs of permutations. It then examines the connection between matrix integrals and maps, focusing on the Hermitian one-matrix model with a polynomial potential and how the formal expansio
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Relaxed mean graph"

1

Bond, Joe, Cristina David, Minh Nguyen, Dominic Orchard, and Roly Perera. "Cognacy Queries over Dependence Graphs for Transparent Visualisations." In Lecture Notes in Computer Science. Springer Nature Switzerland, 2025. https://doi.org/10.1007/978-3-031-91118-7_6.

Full text
Abstract:
Abstract Charts, figures, and text derived from data play an important role in decision making. But making sense of or fact-checking outputs means understanding how they relate to the underlying data. Even for experts with access to the source code and data sets, this poses a significant challenge. We introduce a new program analysis framework (A supporting artifact is available at https://zenodo.org/records/14637654 [5].) which supports interactive exploration of fine-grained IO relationships directly through computed outputs, using dynamic dependence graphs. This framework enables a novel no
APA, Harvard, Vancouver, ISO, and other styles
2

Nisha, M. I. Jawahar, and V. Annamma. "Square Difference Geometric Mean 3-Equitable Labeling of Certain Cycle-Related Graphs." In Springer Proceedings in Mathematics & Statistics. Springer Nature Switzerland, 2012. https://doi.org/10.1007/978-3-031-77764-6_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Matoušek, Jiří, and Jaroslav Nešetřil. "Drawing graphs in the plane." In Invitation to Discrete Mathematics. Oxford University PressOxford, 1998. http://dx.doi.org/10.1093/oso/9780198502081.003.0005.

Full text
Abstract:
Abstract Often it is advantageous to draw graphs. As you can see, most of the graphs in this book are specified by a picture (instead of a list of vertices and edges, say). But so far we have been studying properties of graphs not related to their drawings, and the role of drawings was purely auxiliary. In this chapter the subject of analysis will be the drawing of graphs itself and we will mainly investigate graphs that can be drawn in the plane without edge crossings. Such graphs are called planar. From the numerous pictures shown so far and from the informal definition given in Section 3.1,
APA, Harvard, Vancouver, ISO, and other styles
4

Munda, Giacomo, Dagmar Gromann, and Tobias Heinzle. "Vector Space Transformations to Uncover Knowledge Graphs in Neural Language Models." In Frontiers in Artificial Intelligence and Applications. IOS Press, 2025. https://doi.org/10.3233/faia250204.

Full text
Abstract:
Transformer-based language models are known to encode factual information in their hidden representations, however, an open question is how to explicate this implicitly encoded knowledge. Approaches to unveil encoded factual associations relate to prompt-based methods, techniques to localize or edit specific model weights, and to trace the information flow during inference. Inspired by evidence of entire dependency graphs in embedding (sub-)spaces of these models, this chapter presents an approach to utilize linear transformation of a model’s vector representation space to uncover the properti
APA, Harvard, Vancouver, ISO, and other styles
5

Lombardi Gabriele, Rozza Alessandro, Casiraghi Elena, and Campadelli Paola. "A Novel Approach for Geometric Clustering based on Tensor Voting Framework." In Frontiers in Artificial Intelligence and Applications. IOS Press, 2011. https://doi.org/10.3233/978-1-60750-972-1-129.

Full text
Abstract:
In this work we propose a novel geometric clustering algorithm based on the Tensor Voting Framework (TVF). More precisely, we propose the construction of a weighted graph by means of the information diffused by TVF during the vote casting step. This graph, which summarizes informations related to the manifold geometric structure, was used for clustering purposes. To this aim, we applied the well known Dijkstra and Ford Fulkerson algorithms to recursively separate weakly connected graph components.
APA, Harvard, Vancouver, ISO, and other styles
6

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
7

Ma, Li. "Interior gradient estimates for mean curvature type equations and related flows." In Analysis and Partial Differential Equations on Manifolds, Fractals and Graphs. De Gruyter, 2021. http://dx.doi.org/10.1515/9783110700763-015.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Palma, Cosimo. "Neurosymbolic Narrative Generation for Cultural Heritage." In Frontiers in Artificial Intelligence and Applications. IOS Press, 2023. http://dx.doi.org/10.3233/faia230129.

Full text
Abstract:
Aim of my research is to exploit Linguistic Linked Open Data (LLOD) as base for advanced Cultural Heritage (CH) fruition by means of Automatic Story Generation (ASG) . Following the rationale that discovering and reviving already existing (yet latent) narratives is worthier than automatically generating them from anew in eliciting the user’s interest, the input-2-graph and the graph-2-sequence ASG-pipeline phases, heavily relying on LLOD, will be given a deeper focus, whereby the final Natural Language Generation (NLG) module will be constrained by the entities and relations established in the
APA, Harvard, Vancouver, ISO, and other styles
9

Hedman, Shawn. "Computability and complexity." In A First Course in Logic. Oxford University Press, 2004. http://dx.doi.org/10.1093/oso/9780198529804.003.0011.

Full text
Abstract:
In this chapter we study two related areas of theoretical computer science: computability theory and computational complexity. Each of these subjects take mathematical problems as objects of study. The aim is not to solve these problems, but rather to classify them by level of difficulty. Time complexity classifies a given problem according to the length of time required for a computer to solve the problem. The polynomial-time problems P and the nondeterministic polynomial-time problems NP are the two most prominent classes of time complexity. Some problems cannot be solved by the algorithmic
APA, Harvard, Vancouver, ISO, and other styles
10

Becker, Julia, Mario Botsch, Philipp Cimiano, et al. "Virtual Reality Based Access to Knowledge Graphs for History Research." In Knowledge Graphs: Semantics, Machine Learning, and Languages. IOS Press, 2023. http://dx.doi.org/10.3233/ssw230011.

Full text
Abstract:
Purpose: Knowledge graphs have so far been intensively used in the cultural heritage domain. Current interaction paradigms and interfaces however are often limited to textual representations or 2D visualizations, not taking into account the 4D nature of data. In digital history in particular, where events as well as geographical and temporal relationships play an important role, exploration paradigms that take into account the 4D nature of event-related data are important, as they have the potential to support historians in generating new knowledge and discovering new relationships. In this pa
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Relaxed mean graph"

1

Michel, James. "Ampacity Characteristics of Zinc Ribbon." In CORROSION 2005. NACE International, 2005. https://doi.org/10.5006/c2005-05621.

Full text
Abstract:
Abstract Zinc ribbon anode has been used for many years as a means of mitigating induced AC current on pipelines. Zinc ribbon anode has been very effective in this regard. The amount of amperage zinc ribbon will handle in a grounding application has been determined in the past by empirical calculations based on physical and metallurgical characteristics. This work presents the results of laboratory tests performed on three sizes of zinc ribbon anode to give actual ampacity characteristics. The resulting graphs can be used as a reference for designing AC mitigation and related grounding systems
APA, Harvard, Vancouver, ISO, and other styles
2

Eckert, Maroš, Peter Fabo, Michal Kuba, and Peter Jancich. "Development and Implementation of Equipment for Diagnosing and Testing the Properties of 3D Printing Samples." In Materials and Technologies for Defense and Security. Trans Tech Publications Ltd, 2025. https://doi.org/10.4028/p-l8d07o.

Full text
Abstract:
In connection with the development of 3D printing and expanding the possibilities of implementing 3D printing outputs in technology and industry, there is a growing need to know the properties of printed products during their mechanical stress depending on their internal structure, temperature, static and cyclic mechanical stress. The subject of the contribution is the development and construction of precise testing equipment for 3D printing products, such as plastics as well as metallic and non-metallic samples up to the level of force acting on samples with a maximum value of 5 kN. The test
APA, Harvard, Vancouver, ISO, and other styles
3

Shainy, V. Shendra, and V. Balaji. "Relaxed mean labeling for three star graph." In PROCEEDINGS OF INTERNATIONAL CONFERENCE ON ADVANCES IN MATERIALS RESEARCH (ICAMR - 2019). AIP Publishing, 2020. http://dx.doi.org/10.1063/5.0017339.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Sangeetha, S., and U. Usharani. "Relaxed mean labeling of some corona graphs." In THE 11TH NATIONAL CONFERENCE ON MATHEMATICAL TECHNIQUES AND APPLICATIONS. AIP Publishing, 2019. http://dx.doi.org/10.1063/1.5112252.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Garg, Sankalp, Navodita Sharma, Woojeong Jin, and Xiang Ren. "Temporal Attribute Prediction via Joint Modeling of Multi-Relational Structure Evolution." In Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}. International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/ijcai.2020/386.

Full text
Abstract:
Time series prediction is an important problem in machine learning. Previous methods for time series prediction did not involve additional information. With a lot of dynamic knowledge graphs available, we can use this additional information to predict the time series better. Recently, there has been a focus on the application of deep representation learning on dynamic graphs. These methods predict the structure of the graph by reasoning over the interactions in the graph at previous time steps. In this paper, we propose a new framework to incorporate the information from dynamic knowledge grap
APA, Harvard, Vancouver, ISO, and other styles
6

Revathy, R., and Dr K. Amuthavalli. "Radio harmonic mean labeling of some star related graphs." In 1ST INTERNATIONAL CONFERENCE ON MATHEMATICAL TECHNIQUES AND APPLICATIONS: ICMTA2020. AIP Publishing, 2020. http://dx.doi.org/10.1063/5.0025495.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Sreeji, S., and S. S. Sandhya. "Fibonacci power 3 mean labeling of cycle related graphs." In 2ND INTERNATIONAL CONFERENCE ON MATHEMATICAL TECHNIQUES AND APPLICATIONS: ICMTA2021. AIP Publishing, 2022. http://dx.doi.org/10.1063/5.0110626.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Kobina, Piriziwè, Thierry Duval, Laurent Brisson, and Anthony David. "Human-centered Evaluation of 3D Radial Layouts for Centrality Visualization." In WSCG'2022 - 30. International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision'2022. Západočeská univerzita, 2022. http://dx.doi.org/10.24132/csrn.3201.9.

Full text
Abstract:
In this paper we propose improvements to the 3D radial layouts that make it possible to visualize centrality mea- sures of the nodes in a graph. Our improvements mainly relate edge drawing and the evaluation of the 3D radial layouts. First, we projected not only the nodes but also the edges onto the visualization surfaces in order to reduce the node overlap that could be observed in previous 3D radial layouts. Secondly, we proposed a human-centered evaluation in order to compare the efficiency score and the time to complete tasks of the 3D radial layouts to those of the 2D radial layouts. The
APA, Harvard, Vancouver, ISO, and other styles
9

Petti, M., J. Toppi, F. Pichiorri, et al. "Aged-related changes in brain activity classification with respect to age by means of graph indexes." In 2013 35th Annual International Conference of the IEEE Engineering in Medicine and Biology Society (EMBC). IEEE, 2013. http://dx.doi.org/10.1109/embc.2013.6610509.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Qian, Wei, Cong Fu, Yu Zhu, Deng Cai, and Xiaofei He. "Translating Embeddings for Knowledge Graph Completion with Relation Attention Mechanism." In Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/596.

Full text
Abstract:
Knowledge graph embedding is an essential problem in knowledge extraction. Recently, translation based embedding models (e.g., TransE) have received increasingly attentions. These methods try to interpret the relations among entities as translations from head entity to tail entity and achieve promising performance on knowledge graph completion. Previous researchers attempt to transform the entity embedding concerning the given relation for distinguishability. Also, they naturally think the relation-related transforming should reflect attention mechanism, which means it should focus on only a p
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Relaxed mean graph"

1

Monetary Policy Report - January 2022. Banco de la República, 2022. http://dx.doi.org/10.32468/inf-pol-mont-eng.tr1-2022.

Full text
Abstract:
Macroeconomic summary Several factors contributed to an increase in projected inflation on the forecast horizon, keeping it above the target rate. These included inflation in December that surpassed expectations (5.62%), indexation to higher inflation rates for various baskets in the consumer price index (CPI), a significant real increase in the legal minimum wage, persistent external and domestic inflationary supply shocks, and heightened exchange rate pressures. The CPI for foods was affected by the persistence of external and domestic supply shocks and was the most significant contributor t
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Relaxed mean graph' for particular source types:
Journal articles
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!

To the bibliography