Relevant bibliographies by topics / Cycle Related Graph

Contents

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

Academic literature on the topic 'Cycle Related Graph'

Author: Grafiati
Published: 7 June 2025
Last updated: 17 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 'Cycle Related 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 "Cycle Related Graph"

1

Nivetha, S., and V. Maheswari. "Isolate Domination Decomposition of Tensor Product of Cycle Related Graphs." Indian Journal Of Science And Technology 17, no. 30 (2024): 3145–54. http://dx.doi.org/10.17485/ijst/v17i30.1796.

Full text
Abstract:
Objectives: This study deals about tensor product of some cycle related graphs which admits an IDD. Methods: We have a decomposed a graph into parts in such a way that the isolate domination number of partitions ranges from to . We have used basic terms and propositions of isolate domination over the graph in order to obtain the results. Findings: We have introduced Isolate Domination Decomposition (IDD) of Graphs 1 and is defined as a collection of subgraphs of such that every edge of belongs to exactly one each is connected and it contains atleast one edge and . Also we have found the range of vertices for a graph under which the conditions of IDD are satisfied along with the converse part. Novelty: Domination and Decomposition are widely used in networking, block design, coding theory and many fields. Motivated by the concept of ascending pendant domination and decomposition 2, 3, we have used here the isolate domination combined with decomposition to characterize the graphs which admits this new parameter and to investigate their vertex bounds. Keywords: Dominating Set, Domination Number, Isolate Dominating Set, Decomposition, Isolate Domination Decomposition, Tensor Product, Cycle Related Graph
APA, Harvard, Vancouver, ISO, and other styles
2

Asif, Fatima, Agha Kashif, Sohail Zafar, and Michael Onyango Ojiema. "Mostar Index of Cycle-Related Structures." Journal of Chemistry 2022 (March 7, 2022): 1–11. http://dx.doi.org/10.1155/2022/9411947.

Full text
Abstract:
A topological index is a numerical quantity associated with the molecular structure of a chemical compound. This number remains fixed with respect to the symmetry of a molecular graph. Diverse research studies have shown that the topological indices of symmetrical graphs are interrelated with several physiochemical properties such as boiling point, density, and heat of formation. Peripherality is also an important tool to study topological aspects of molecular graphs. Recently, a bond-additive topological index called the Mostar index that measures the peripherality of a graph is investigated which attained wide attention of researchers. In this article, we compute the Mostar index of cycle-related structures such as the Jahangir graph and the cycle graph with chord.
APA, Harvard, Vancouver, ISO, and other styles
3

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
4

Çolakoğlu, Özge. "NM-polynomials and Topological Indices of Some Cycle-Related Graphs." Symmetry 14, no. 8 (2022): 1706. http://dx.doi.org/10.3390/sym14081706.

Full text
Abstract:
Topological indices (molecular descriptors) are numerical values of a chemical structure and represented by a graph. Molecular descriptors are used in QSPR/QSAR modeling to determine a chemical structure’s physical, biological, and chemical properties. The cycle graphs are symmetric graphs for any number vertices. In this paper, recently defined neighborhood degree sum-based molecular descriptors and polynomials are studied. NM-polynomials and molecular descriptors of some cycle-related graphs, which consist of the wheel graph, gear graph, helm graph, flower graph, and friendship graph, are computed and compared.
APA, Harvard, Vancouver, ISO, and other styles
5

Dr., A. Ezhil. "PRIME LABELLING FOR SOME BIPARTIATE RELATED GRAPHS." INTERNATIONAL JOURNAL OF MATHEMATICS AND COMPUTER RESEARCH 11, no. 07 (2023): 3571–74. https://doi.org/10.5281/zenodo.8175239.

Full text
Abstract:
A graph G = (V,E) with ‘n’ vertices is said to have a prime labeling if its vertices are labelled with distinct positive integers not exceeding n such that for each pair of adjacent vertices are relatively prime.  A graph G which admits prime labeling is called a prime graph.  In this paper, we investigate prime labeling for some bipartiate and cycle related graphs.  We also discuss the prime labeling of some graph operation namely joint sum and path joining of bipartiate and cycle graphs
APA, Harvard, Vancouver, ISO, and other styles
6

Zeen El Deen, Mohamed R. "Enumeration of spanning trees in prisms of some graphs." Proyecciones (Antofagasta) 42, no. 2 (2023): 339–91. http://dx.doi.org/10.22199/issn.0717-6279-4664.

Full text
Abstract:
In graph theory, a prism over a graph G is the cartesian product of the graph G with P₂. The purpose of this work is to investigate the complexity of the prisms of some path and cycle-related graphs. In particular, we obtain simpler and more explicit formulas for the complexity of a special class of prisms of path-related graphs: fan graph, ladder graph, the composition Pn[P₂] graph, and book graph. Moreover, we obtain straightforward formulas for the complexity of a special class of prisms of cycle-related graphs: wheel graph, gear graph, prism graph, n−crossed prism graph, mirror graph M(Cn) of even cycle Cn, twisted prism, total graph T(Cn) of the cycle Cn, the friendship graph, the flower graph, and planner sunflower graph. These closed formulas are deduced using some basic properties of block matrix, recurrence relation, eigenvalues of circulant matrices, and orthogonal polynomials.
APA, Harvard, Vancouver, ISO, and other styles
7

Wei, Changcheng, Muhammad Faisal Nadeem, Hafiz Muhammad Afzal Siddiqui, Muhammad Azeem, Jia-Bao Liu, and Adnan Khalil. "On Partition Dimension of Some Cycle-Related Graphs." Mathematical Problems in Engineering 2021 (March 5, 2021): 1–8. http://dx.doi.org/10.1155/2021/4046909.

Full text
Abstract:
Let G be a simple connected graph. Suppose Δ = Δ 1 , Δ 2 , … , Δ l an l -partition of V G . A partition representation of a vertex α w . r . t Δ is the l − vector d α , Δ 1 , d α , Δ 2 , … , d α , Δ l , denoted by r α | Δ . Any partition Δ is referred as resolving partition if ∀ α i ≠ α j ∈ V G such that r α i | Δ ≠ r α j | Δ . The smallest integer l is referred as the partition dimension pd G of G if the l -partition Δ is a resolving partition. In this article, we discuss the partition dimension of kayak paddle graph, cycle graph with chord, and a graph generated by chain of cycles. It has been shown that the partition dimension of the said families of graphs is constant.
APA, Harvard, Vancouver, ISO, and other styles
8

P. Sumathi. "(S,d)Magic Labeling of Some Cycle Related Graphs." Communications on Applied Nonlinear Analysis 31, no. 6s (2024): 489–98. http://dx.doi.org/10.52783/cana.v31.1239.

Full text
Abstract:
Objective: To examine the existence of (s,d) Magic Labeling on cycle related graphs.Methods: Let G (p,q) be a simple, non-trivial, connected, undirected graph with p vertices and q edges. Let f:V(G)→{s,s+d,s+2d,..s+(q+1)d} and g:E(G)→{d,2d,3d…2(q-1)d} be an injective function. Then, for any u,v∈V(G) and uv∈E(G),f(u)+g(uv)+f(v) is a constant, and the function f is said to be (s, d) magic labeling. If a graph G admits (s,d) magic labeling, then it is referred to as a (s,d) magic graph.Findings: In this paper the existence of (s,d) magic labeling in some cycle related graphs such as a Cycle graph C_(n⊙K_(1,m) ) graph, n -Sunlet graph, Friendship graph Flower graph and wheel graph were found. Novelty: The labeling of the vertices and edges is done mathematically, and this leads to the creation of a new labeling known as (s,d) magic labeling.
APA, Harvard, Vancouver, ISO, and other styles
9

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

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

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

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

Dissertations / Theses on the topic "Cycle Related Graph"

1

Rudoy, Mikhail. "Hamiltonian cycle and related problems : vertex-breaking, grid graphs, and Rubik's Cubes." Thesis, Massachusetts Institute of Technology, 2017. http://hdl.handle.net/1721.1/113112.

Full text
Abstract:
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2017.<br>This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.<br>Cataloged from student-submitted PDF version of thesis.<br>Includes bibliographical references (pages 123-124).<br>In this thesis, we analyze the computational complexity of several problems related to the Hamiltonian Cycle problem. We begin by introducing a new problem, which we call Tree-Residue Vertex-Breaking (TRVB). Given a multigraph G some of whose vertices are marked "breakable," TRVB asks whether it is possible to convert G into a tree via a sequence of applications of the vertex-breaking operation: disconnecting the edges at a degree-G breakable vertex by replacing that vertex with G degree-1 vertices. We consider the special cases of TRVB with any combination of the following additional constraints: G must be planar, G must be a simple graph, the degree of every breakable vertex must belong to an allowed list G, and the degree of every unbreakable vertex must belong to an allowed list G. We fully characterize these variants of TRVB as polynomially solvable or NP-complete. The TRVB problem is useful when analyzing the complexity of what could be called single-traversal problems, where some space (i.e., a configuration graph or a grid) must be traversed in a single path or cycle subject to local constraints. When proving such a problem NP-hard, a reduction from TRVB can often be used as a simpler alternative to reducing from a hard variant of Hamiltonian Cycle. Next, we analyze several variants of the Hamiltonian Cycle problem whose complexity was left open in a 2007 paper by Arkin et al [3]. That paper is a systematic study of the complexity of the Hamiltonian Cycle problem on square, triangular, or hexagonal grid graphs, restricted to polygonal, thin, super-thin, degree-bounded, or solid grid graphs. The authors solved many combinations of these problems, proving them either polynomially solvable or NP-complete, but left three combinations open. We prove two of these unsolved combinations to be NP-complete: Hamiltonian Cycle in Square Polygonal Grid Graphs and Hamiltonian Cycle in Hexagonal Thin Grid Graphs. We also consider a new restriction, where the grid graph is both thin and polygonal, and prove that the Hamiltonian Cycle problem then becomes polynomially solvable for square, triangular, and hexagonal grid graphs. Several of these results are shown by application of the TRVB results, demonstrating the usefulness of that problem. Finally, we apply the Square Grid Graph Hamiltonian Cycle problem to close a longstanding open problem: we prove that optimally solving an n x n x n Rubik's Cube is NP-complete. This improves the previous result that optimally solving an n x n x n Rubik's Cube with missing stickers is NP-complete. We prove this result first for the simpler case of the Rubik's Square -- an n x n x 1 generalization of the Rubik's Cube -- and then proceed with a similar but more complicated proof for the Rubik's Cube case.<br>by Mikhail Rudoy.<br>M. Eng.
APA, Harvard, Vancouver, ISO, and other styles
2

Noual, Mathilde. "Mises à jour de réseaux d'automates." Phd thesis, Ecole normale supérieure de lyon - ENS LYON, 2012. http://tel.archives-ouvertes.fr/tel-00726560.

Full text
Abstract:
Cette thèse s'intéresse aux évènements et aux ordonnancements d'évènements se produisant au sein de réseaux d'éléments conceptuels prédéterminés. Dans ces réseaux, les éléments, appelés plutôt "automates", s'incitent les uns les autres à changer d'état en accord avec des règles prédéfinies qui, précisément, définissent le (fonctionnement du) réseau. Lorsqu'un automate se conforme effectivement aux influences qu'il reçoit de la part des autres, on dit que son état est mis à jour. Les évènements élémentaires considérés sont les changements d'états des automates. Définir un mode de mise à jour pour l'ensemble des automates d'un réseau permet de sélectionner certains évènements parmi l'ensemble de ceux qui sont a priori possibles. Cela permet aussi d'organiser et d'ordonner les évènements les uns par rapport aux autres de façon, par exemple, à imposer que des évènements indépendants se produisent simultanément ou simplement, de manière assez rapprochée pour qu'aucun autre événement ne puisse se produire pendant leur occurrence. Informellement, les modes de mise à jour peuvent donc être interprétés comme l'expression d'influences extérieures au réseau interdisant certains changements, ou alors comme la formalisation d'une version relâchée et relative de l'écoulement de temps. Cette thèse propose d'étudier leur influence sur le comportement des réseaux. Et afin de distinguer cette influence de celle de la structure des réseaux, elle commence par mettre en évidence le rôle de certains motifs structurels. Après ça, elle s'intéresse en particulier à l'information "encodée" dans une séquence de mises à jour et à l'impact du synchronisme dans celles-ci.
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Cycle Related Graph"

1

Yust, Jason. Graph Theory for Temporal Structure. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780190696481.003.0014.

Full text
Abstract:
This chapter introduces mathematical graph theory and develops graph-theory concepts that are useful for temporal networks. By generating chord progressions from networks, the potential musical and temporal meaning of graph-theory concepts, especially cycles, is emphasized. A number of concepts related to trees are introduced to show hierarchical aspects of temporal structure, and to allow for a comparison of Fred Lerdahl and Ray Jackendoff’s prolongational trees to temporal structures. This suggests an enrichment of MOPs through spanning trees, and is channelled into a discussion of graph-theoretic algebras, cycle and edge-cut algebras, as they apply to temporal structures.
APA, Harvard, Vancouver, ISO, and other styles
2

Huckenbeck, Ulrich. Extremal Paths in Graphs: Foundations, Search Strategies, and Related Topics (Mathematical Topics). VCH Publishers, 1998.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Cycle Related Graph"

1

Adalja, D. G., and G. V. Ghodasara. "Sum Divisor Cordial Labeling for Vertex Switching of Cycle related Graphs." In Recent Advancements in Graph Theory. CRC Press, 2020. http://dx.doi.org/10.1201/9781003038436-9.

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

Blažej, Václav, Pratibha Choudhary, Dušan Knop, Jan Matyáš Křišt’an, Ondřej Suchý, and Tomáš Valla. "Constant Factor Approximation for Tracking Paths and Fault Tolerant Feedback Vertex Set." In Approximation and Online Algorithms. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-92702-8_2.

Full text
Abstract:
AbstractConsider a vertex-weighted graph G with a source s and a target t. Tracking Paths requires finding a minimum weight set of vertices (trackers) such that the sequence of trackers in each path from s to t is unique. In this work, we derive a factor 66-approximation algorithm for Tracking Paths in weighted graphs and a factor 4-approximation algorithm if the input is unweighted. This is the first constant factor approximation for this problem. While doing so, we also study approximation of the closely related r-Fault Tolerant Feedback Vertex Set problem. There, for a fixed integer r and a given vertex-weighted graph G, the task is to find a minimum weight set of vertices intersecting every cycle of G in at least $$r+1$$ r + 1 vertices. We give a factor $$\mathcal {O}(r^2)$$ O ( r 2 ) approximation algorithm for r-Fault Tolerant Feedback Vertex Set if r is a constant.
APA, Harvard, Vancouver, ISO, and other styles
3

Lichen, Junran. "Cycle-Connected Mixed Graphs and Related Problems." In Combinatorial Optimization and Applications. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-92681-6_47.

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

Levit, Vadim E., and David Tankus. "On Related Edges in Well-Covered Graphs without Cycles of Length 4 and 6." In Graph Theory, Computational Intelligence and Thought. Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-02029-2_14.

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

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
6

Dorathy, C., and N. Nagamani. "GRACEFUL LABELING ON CYCLE RELATED GRAPHS." In Futuristic Trends in Contemporary Mathematics & Applications Volume 3 Book 4. Iterative International Publisher, Selfypage Developers Pvt Ltd, 2024. http://dx.doi.org/10.58532/v3bbcm4p2ch10.

Full text
Abstract:
A graceful labeling of of a graph G(p.q) is an injection f : V(G) → {0,1,...,q} such that while each edge uv is assigned the label(absolute difference of the corresponding vertex labels), the induced edge labels are all distinct. A graph which can be labeled gracefully is said to be a graceful graph. This chapter investigates the gracefulness of cycle related graphs using pronic numbers.
APA, Harvard, Vancouver, ISO, and other styles
7

Ustimenko V. "On the Cryptographical Properties of Extremal Algebraic Graphs." In NATO Science for Peace and Security Series - D: Information and Communication Security. IOS Press, 2009. https://doi.org/10.3233/978-1-60750-019-3-256.

Full text
Abstract:
In this paper we consider some properties of stream ciphers related to arithmetical dynamical systems defined in [41] over commutative ring K. We modify the stream cipher algorithm proposed in [40] by adding the key management block based on the idea of &amp;ldquo;hidden discrete logarithm&amp;rdquo;. The straightforward generalization of such encryption can be used in a public key mode. We introduce much more general algorithms in terms of automata related to Directed Algebraic Graphs with High Girth Indicator. In finite case we use only directed graphs of irreflexive binary relations such that numbers of inputs and outputs are the same for each node (balanced directed graphs). The families of such regular graphs of bounded degree with growing girth indicator and the size which is close to the maximal possible value (or order close to minimum) can be used for the design of encryption algorithm. One of the important parameters of the Turing machine related to the family is the speed of growth of the girth indicator. Natural upper bound for such speed can be obtained in terms of Extremal graph theory for balanced directed graphs which is motivated be Erd&amp;ouml;s&amp;rsquo; Even Circuit Theorem which bounds the size of a simple graph without even cycle. Explicit constructions of such families can be used not only in Cryptography but in the Coding Theory as well.
APA, Harvard, Vancouver, ISO, and other styles
8

Liew, Yingjia, and Yunfeng Dong. "Parameter Selection for Digital Satellite Model Updating with Knowledge Graph." In Advances in Transdisciplinary Engineering. IOS Press, 2023. http://dx.doi.org/10.3233/atde231016.

Full text
Abstract:
Digital twin technology has played an indispensable role in the recent satellite life cycle, specifically in design, testing, and operation monitoring. A digital twin is created according to a physical satellite and can mirror its performance and parameters. The physical satellite is occasionally affected by dynamic disturbances when in orbit, causing inconsistencies with its digital twin, thus requiring the digital twin model to be continuously updated through model parameter adjustments. Nonetheless, the digital twin model involves numerous parameters with coupled relationships; adjusting all simultaneously might be impractical as it requires high computational and time. Since only some of the model parameters have a significant impact on the digital model’s outputs, we propose a parameter selection method that utilizes knowledge graph technology for digital satellite model updating. Firstly, the satellite state variables and their related telemetry parameters of satellite subsystems in the digital satellite model are defined. Secondly, a knowledge graph consisting of the correlation and sensitivity relationships of the state variables and telemetry parameters is built. Thirdly, a clustering algorithm and graph reasoning algorithms are employed on this knowledge graph to select and group the state variables and telemetry parameters required in model updating. The results show that by updating the state variables and telemetry parameters selected from the knowledge graph, not only can the state variables converge to optimal values in fewer iterations, but a more accurate digital satellite model can also be obtained.
APA, Harvard, Vancouver, ISO, and other styles
9

Sirkka, Antti, and Marko Junkkari. "Multidimensional Analysis of Supply Chain Environmental Performance." In Sustainable ICTs and Management Systems for Green Computing. IGI Global, 2012. http://dx.doi.org/10.4018/978-1-4666-1839-8.ch010.

Full text
Abstract:
Monitoring the environmental performance of a product is recognized to be increasingly important. The most common method of measuring the environmental performance is the international standards of Life Cycle Assessment (LCA). Typically, measuring is based on estimations and average values at product category level. In this chapter, the authors present a framework for measuring environmental impact at the item level. Using Traceability Graph emissions and resources, it can be monitored from the data management perspective. The model can be mapped to any precision level of physical tracing. At the most precise level, even a single physical object and its components can be analyzed. This, of course, demands that the related objects and their components are identified and mapped to the database. From the opposite perspective, the authors’ model also supports rough level analysis of products and their histories. In terms of the Traceability Cube, multidimensional analysis can be applied for traceability data.
APA, Harvard, Vancouver, ISO, and other styles
10

Hosseinijou, Seyed Abbas, Farhad Kiya, and Hamed Kalantari. "Trees." In Graph Theory for Operations Research and Management. IGI Global, 2013. http://dx.doi.org/10.4018/978-1-4666-2661-4.ch005.

Full text
Abstract:
In this chapter, the authors present a special and important type of graphs named Trees. Although the concept of a tree is simple, many applications of graph theory in science and engineering are related to this type. The topics of this chapter are selected based on theory and application of trees. Rooted trees, spanning trees, fundamental cycles and bounds, and tree search algorithms are covered. However, this chapter mainly focuses on spanning trees and tree search algorithms.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Cycle Related Graph"

1

Thilagavathy, K. P., K. Gavaskar, S. Sriram, and C. Subinsha. "A Study on b-chromatic number of comb product of cycle graph related graphs." In 2025 3rd International Conference on Advancements in Electrical, Electronics, Communication, Computing and Automation (ICAECA). IEEE, 2025. https://doi.org/10.1109/icaeca63854.2025.11012329.

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

Salat, Arti, and Amit Sharma. "Automorphism groups and distinguishing numbers of some graphs related to cycle graph." In 2ND INTERNATIONAL CONFERENCE ON APPLIED MATHEMATICS AND COMPUTATIONAL SCIENCES 2022 (ICAMCS-2022). AIP Publishing, 2024. http://dx.doi.org/10.1063/5.0199429.

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

Meena, S., G. Gajalakshmi, and P. Kavitha. "Prime labeling of h-super subdivision of cycle related graph." In 2ND INTERNATIONAL CONFERENCE ON MATHEMATICAL TECHNIQUES AND APPLICATIONS: ICMTA2021. AIP Publishing, 2022. http://dx.doi.org/10.1063/5.0109588.

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

An, Qiyuan, Hamza Reza Pavel, Ayon Roy, and Fillia Makedon. "Residual Graph Network for Assessing Cognitive Fatigue from Gait Cycle Analysis." In PETRA '24: The PErvasive Technologies Related to Assistive Environments Conference. ACM, 2024. http://dx.doi.org/10.1145/3652037.3652065.

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

Kim, Chansoo, Chang-Hyun Chung, and Kwang Won Ahn. "Quantification Frameworks and Their Application for Evaluating the Software Quality Factor Using Quality Characteristic Value." In 12th International Conference on Nuclear Engineering. ASMEDC, 2004. http://dx.doi.org/10.1115/icone12-49142.

Full text
Abstract:
Many problems, related with safety, frequently occur because Digital Instrument &amp; Control Systems are widely used and expanding their ranges to many applications in Nuclear Power Plants. It, however, does not hold a general position to estimate an appropriate software quality. Thus, the Quality Characteristic Value, a software quality factor through each software life cycle, is suggested in this paper. The Quality Characteristic Value is obtained as following procedure: 1) Scoring Quality Characteristic Factors (especially correctness, traceability, completeness, and understandability) onto Software Verification and Validation results, 2) Deriving the diamond-shaped graphs by setting values of Factors at each axis and lining every points, and lastly 3) Measuring the area of the graph for Quality Characteristic Value. In this paper, this methodology is applied to Plant Control System. In addition, the series of quantification frameworks exhibit some good characteristics in the view of software quality factor. More than any thing else, it is believed that introduced framework may be applicable to regulatory guide, software approval procedures, due to its soundness and simple characteristics.
APA, Harvard, Vancouver, ISO, and other styles
6

Wu, Nan, and Qingjin Peng. "Maintainability Evaluation Based on the Product Disassembly Analysis." In ASME 2009 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2009. http://dx.doi.org/10.1115/detc2009-86394.

Full text
Abstract:
Maintainability is an important product characteristic related to the product life-time operation and the operation cost. Maintainability increases product’s serviceability and decreases product’s maintenance cost. Product disassembability is one of the key factors of product maintainability. A disassembly is normally required for product repairing, product remanufacturing, components reusing, and materials recycling in the product life-cycle management. A better disassembly plan will improve efficiency of these processes for product maintainability. This paper introduces the product maintainability analysis based on the disassembly sequence evaluation. An AND/OR graph based disassembly analysis and the cost-based evaluation are introduced for the evaluation of product maintainability. The proposed data structure and methods are discussed. The system developed is demonstrated using a case study.
APA, Harvard, Vancouver, ISO, and other styles
7

Kalaimathi, M., and B. J. Balamurugan. "Biconditional cordial labeling of cycle related graphs." In 4TH INTERNATIONAL CONFERENCE ON THE SCIENCE AND ENGINEERING OF MATERIALS: ICoSEM2019. AIP Publishing, 2020. http://dx.doi.org/10.1063/5.0028659.

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

Alfarisi, Ridho, M. Imam Utoyo, and Dafik. "Local multiset dimension of related cycle graphs." In INTERNATIONAL CONFERENCE ON SCIENCE AND APPLIED SCIENCE (ICSAS) 2021. AIP Publishing, 2022. http://dx.doi.org/10.1063/5.0072516.

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

Mehrabian, Abbas, Ankit Anand, Hyunjik Kim, et al. "Finding Increasingly Large Extremal Graphs with AlphaZero and Tabu Search." In Thirty-Third International Joint Conference on Artificial Intelligence {IJCAI-24}. International Joint Conferences on Artificial Intelligence Organization, 2024. http://dx.doi.org/10.24963/ijcai.2024/772.

Full text
Abstract:
This work proposes a new learning-to-search benchmark and uses AI to discover new mathematical knowledge related to an open conjecture of Erdos (1975) in extremal graph theory. The problem is to find graphs with a given size (number of nodes) that maximize the number of edges without having 3- or 4-cycles. We formulate this as a sequential decision-making problem and compare AlphaZero, a neural network-guided tree search, with tabu search, a heuristic local search method. Using either method, by introducing a curriculum---jump-starting the search for larger graphs using good graphs found at smaller sizes---we improve the state-of-the-art lower bounds for several sizes. We also propose a flexible graph-generation environment and a permutation-invariant network architecture for learning to search in the space of graphs.
APA, Harvard, Vancouver, ISO, and other styles
10

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
You might also be interested in the extended bibliographies on the topic 'Cycle Related 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