Academic literature on the topic 'Cycle graph C_n'

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 graph C_n.'

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 graph C_n"

1

Mn, Abdilla Nurul Azisah, Hasmawati Hasmawati, and Budi Nurwahyu. "Edge Metric Dimension of Comb Product Cycles Versus Stars and Fans." Journal of Advanced Research in Applied Sciences and Engineering Technology 49, no. 2 (2024): 52–63. http://dx.doi.org/10.37934/araset.49.2.5263.

Full text
Abstract:
The edge metric dimension finding of a graph resulting from the comb product on a cycle graph to the complete graph and the fact about the dominant vertex in the complete graph arise a problem about the edge metric dimension of a graph resulting from the comb product on a cycle graph to the other graphs that have dominant vertex such as star and fan graph. This study aims to determine the edge metric dimension of the graph resulting from the comb product on a cycle graph to the star and fan graph, respectively. The results show that the upper and lower bound of the edge metric dimension of both graphs are equivalent so that an exact edge metric dimension is obtained. The edge metric dimension of the graph comb product of the cycle graph C_n to the star graph S_(1,m) is n(m-1). The edge metric dimension of the graph comb product of the cycle graph C_n to the fan graph F_(1,m) is n(m-1).
APA, Harvard, Vancouver, ISO, and other styles
2

Grzelec, Igor, Tom� Madaras, and Alfr�d Onderko. "On uniqueness of packing of three copies of 2-factors." Opuscula Mathematica 45, no. 1 (2025): 79–101. https://doi.org/10.7494/opmath.2025.45.1.79.

Full text
Abstract:
The packing of three copies of a graph \(G\) is the union of three edge-disjoint copies (with the same vertex set) of \(G\). In this paper, we completely solve the problem of the uniqueness of packing of three copies of 2-regular graphs. In particular, we show that \(C_3,C_4,C_5,C_6\) and \(2C_3\) have no packing of three copies, \(C_7,C_8,C_3 \cup C_4, C_4 \cup C_4, C_3 \cup C_5\) and \(3C_3\) have unique packing, and any other collection of cycles has at least two distinct packings.
APA, Harvard, Vancouver, ISO, and other styles
3

G, Vembarasi, and Gowri R. "Super Root Cube of Cube Difference Labeling of Some Special Graphs." Indian Journal of Science and Technology 14, no. 35 (2021): 2778–83. https://doi.org/10.17485/IJST/v14i35.1336.

Full text
Abstract:
Abstract <strong>Background/Objectives:</strong>&nbsp;This study gives an extended and the new kinds of super root cube of cube difference labeling of some graphs are obtained.&nbsp;<strong>Methods/ Findings:</strong>&nbsp;We derive super root cube of cube difference labeling of path related graph and analyzed cycle related graphs. <strong>Keywords:</strong>&nbsp;Triangular Snake T_n; Cycle graph C_n; Crown C_n&copy;K_1; pendent edge to both sides of each vertex of a path Pn; supr root cube of cube difference labeling of graphs. &nbsp;
APA, Harvard, Vancouver, ISO, and other styles
4

Paluga, Rolando N. "Monophonic Polynomial of the Join of Graphs." Journal of the Indonesian Mathematical Society 31, no. 1 (2025): 1686. https://doi.org/10.22342/jims.v31i1.1686.

Full text
Abstract:
The monophonic polynomial of a graph $G$, denoted by $M(G,x)$, is the polynomial $M(G,x) = \sum_{k=m(G)}^{|G|}M(G, k)x^k $, where $|G|$ is the order of $G$ and $M(G, k)$ is the number of monophonic sets in $G$ with cardinality $k$. In this paper, we delve into some characterizations of monophonic sets in the join of two graphs and use it to determine its corresponding monophonic polynomial. Moreover, we also present the monophonic polynomials of the complete graph $K_n$ $(n \geq 1)$, the path $P_n$ $(n \geq 3)$, the cycle $C_n$ $(n \geq 4)$, the fan $F_n$ $(n \geq 3)$, the wheel $W_n$ $(n \geq 4)$, the complete bipartite $K_{m,n}$ $(m, n \geq 1)$, $P_m + P_n$ ($m, n \geq 3$), $C_m + C_n$ ($m, n \geq 4$), $P_m + C_n$ ($m \geq 3$ and $n \geq 4$), $P_m + \overline{K_n}$ ($m \geq 3$ and $n \geq 2$), and $C_m + \overline{K_n}$ ($m \geq 4$ and $n \geq 2$). In general, we obtain the monophonic polynomial of the join of two graphs.
APA, Harvard, Vancouver, ISO, and other styles
5

Javadi, R., F. Khoeini, G. R. Omidi, and A. Pokrovskiy. "On the Size-Ramsey Number of Cycles." Combinatorics, Probability and Computing 28, no. 06 (2019): 871–80. http://dx.doi.org/10.1017/s0963548319000221.

Full text
Abstract:
AbstractFor given graphs G1,…, Gk, the size-Ramsey number $\hat R({G_1}, \ldots ,{G_k})$ is the smallest integer m for which there exists a graph H on m edges such that in every k-edge colouring of H with colours 1,…,k, H contains a monochromatic copy of Gi of colour i for some 1 ≤ i ≤ k. We denote $\hat R({G_1}, \ldots ,{G_k})$ by ${\hat R_k}(G)$ when G1 = ⋯ = Gk = G.Haxell, Kohayakawa and Łuczak showed that the size-Ramsey number of a cycle Cn is linear in n, ${\hat R_k}({C_n}) \le {c_k}n$ for some constant ck. Their proof, however, is based on Szemerédi’s regularity lemma so no specific constant ck is known.In this paper, we give various upper bounds for the size-Ramsey numbers of cycles. We provide an alternative proof of ${\hat R_k}({C_n}) \le {c_k}n$ , avoiding use of the regularity lemma, where ck is exponential and doubly exponential in k, when n is even and odd, respectively. In particular, we show that for sufficiently large n we have ${\hat R_2}({C_n}) \le {10^5} \times cn$ , where c = 6.5 if n is even and c = 1989 otherwise.
APA, Harvard, Vancouver, ISO, and other styles
6

Wang, Haiying, Muhammad Javaid, Sana Akram, Muhammad Jamal, and Shaohui Wang. "Least eigenvalue of the connected graphs whose complements are cacti." Open Mathematics 17, no. 1 (2019): 1319–31. http://dx.doi.org/10.1515/math-2019-0097.

Full text
Abstract:
Abstract Suppose that Γ is a graph of order n and A(Γ) = [ai,j] is its adjacency matrix such that ai,j is equal to 1 if vi is adjacent to vj and ai,j is zero otherwise, where 1 ≤ i, j ≤ n. In a family of graphs, a graph is called minimizing if the least eigenvalue of its adjacency matrix is minimum in the set of the least eigenvalues of all the graphs. Petrović et al. [On the least eigenvalue of cacti, Linear Algebra Appl., 2011, 435, 2357-2364] characterized a minimizing graph in the family of all cacti such that the complement of this minimizing graph is disconnected. In this paper, we characterize the minimizing graphs G ∈ $\begin{array}{} {\it\Omega}^c_n \end{array}$, i.e. $$\begin{array}{} \displaystyle \lambda_{min}(G)\leq\lambda_{min}(C^c) \end{array}$$ for each Cc ∈ $\begin{array}{} {\it\Omega}^c_n \end{array}$, where $\begin{array}{} {\it\Omega}^c_n \end{array}$ is a collection of connected graphs such that the complement of each graph of order n is a cactus with the condition that either its each block is only an edge or it has at least one block which is an edge and at least one block which is a cycle.
APA, Harvard, Vancouver, ISO, and other styles
7

Drury, Stephen, and Huiqiu Lin. "Some Graphs Determined By Their Distance Spectrum." Electronic Journal of Linear Algebra 34 (February 21, 2018): 320–30. http://dx.doi.org/10.13001/1081-3810.3613.

Full text
Abstract:
Let $G$ be a connected graph with order $n$. Let $\lambda_1(D(G))\geq \cdots\geq \lambda_n(D(G))$ be the distance spectrum of $G$. In this paper, it is shown that the complements of $P_n$ and $C_n$ are determined by their $D$-spectrum. Moreover, it is shown that the cycle $C_n$ ($n$ odd) is also determined by its $D$-spectrum.
APA, Harvard, Vancouver, ISO, and other styles
8

Bonifacio, Jhon Cris, Clarence Joy Andaya, and Daryl Magpantay. "On the j-Edge Intersection Graph of Cycle Graph." European Journal of Pure and Applied Mathematics 16, no. 4 (2023): 2476–98. http://dx.doi.org/10.29020/nybg.ejpam.v16i4.4870.

Full text
Abstract:
This paper defines a new class of graphs using the spanning subgraphs of a cycle graph as vertices. This class of graphs is called $j$-edge intersection graph of cycle graph, denoted by $E_{C_{(n,j)}}$. The vertex set of $E_{C_{(n,j)}}$ is the set of spanning subgraphs of cycle graph with $j$ edges where $n \geq 3$ and $j$ is a nonnegative integer such that $1 \leq j \leq n$. Moreover, two distinct vertices are adjacent if they have exactly one edge in common. $E_{C_{(n,j)}}$ is considered as a simple graph. Furthermore, $E_{C_{(n,j)}}$ is characterized by the value of $j$ that is when $j=1$ or $\lceil \frac{n}{2} \rceil &lt; j \leq n$ and $2 \leq j \leq \lceil \frac{n}{2} \rceil$. When $j=1$ or $\lceil \frac{n}{2} \rceil &lt; j \leq n$, the new graph only produced an empty graph. Hence, the proponents only considered the value when $2 \leq j \leq \lceil \frac{n}{2} \rceil$ in determining the order and size of $E_{C_{(n,j)}}$. Moreover, this paper discusses necessary and sufficient conditions where the $j$-edge intersection graph of $C_n$ is isomorphic to the cycle graph. Furthermore, the researchers determined a lower bound for the independence number, and an upper bound for the domination number of $E_{C_{(n,j)}}$ when $j=2$.
APA, Harvard, Vancouver, ISO, and other styles
9

Dewi, Putu Kartika. "The Modular Irregularity Strength of C_n⊙mK_1." InPrime: Indonesian Journal of Pure and Applied Mathematics 4, no. 2 (2022): 160–69. http://dx.doi.org/10.15408/inprime.v4i2.26935.

Full text
Abstract:
Let G(V, E) be a graph with order n with no component of order 2. An edge k-labeling α: E(G) →{1,2,…,k} is called a modular irregular k-labeling of graph G if the corresponding modular weight function wt_ α:V(G) → Z_n defined by wt_ α(x) =Ʃ_(xyϵE(G)) α(xy) is bijective. The value wt_α(x) is called the modular weight of vertex x. Minimum k such that G has a modular irregular k-labeling is called the modular irregularity strength of graph G. In this paper, we define a modular irregular labeling on C_n⊙mK_1. Furthermore, we determine the modular irregularity strength of C_n⊙mK_1.Keywords: corona product; cycle; empty graph; modular irregular labeling; modular irregularity strength. AbstrakDiberikan graf G(V, E) dengan orde n dengan tidak ada komponen yang berorde 2. Sebuah pelabelan-k sisi α: E(G) →{1,2,…,k} disebut pelabelan-k tak teratur modular pada graf G jika fungsi bobot modularnya wt_ α:V(G) → Z_n dengan wt_ α(x) =Ʃ_(xyϵE(G)) α(xy) merupakan fungsi bijektif. Nilai wt_α(x) disebut bobot modular dari simpul x. Minimum dari k sehingga G mempunyai pelabelan-k tak teratur modular disebut dengan kekuatan ketakteraturan modular dari graf G. Pada tulisan ini, didefinisikan pelabelan tak teratur modular pada C_n⊙mK_1. Lebih lanjut, ditentukan kekuatan ketakteraturan modular dari C_n⊙mK_1.Kata Kunci: hasil kali korona; lingkaran, graf kosong; pelabelan tak teratur modular; kekuatan ketakteraturan modular.
APA, Harvard, Vancouver, ISO, and other styles
10

Suparta, I. Nengah, Mathiyazhagan Venkatachalam, I. Gede Aris Gunadi, and Putu Andi Cipta Pratama. "GRACEFUL CHROMATIC NUMBER OF SOME CARTESIAN PRODUCT GRAPHS." Ural Mathematical Journal 9, no. 2 (2023): 193. http://dx.doi.org/10.15826/umj.2023.2.016.

Full text
Abstract:
A graph \(G(V,E)\) is a system consisting of a finite non empty set of vertices \(V(G)\) and a set of edges \(E(G)\). A (proper) vertex colouring of \(G\) is a function \(f:V(G)\rightarrow \{1,2,\ldots,k\},\) for some positive integer \(k\) such that \(f(u)\neq f(v)\) for every edge \(uv\in E(G)\). Moreover, if \(|f(u)-f(v)|\neq |f(v)-f(w)|\) for every adjacent edges \(uv,vw\in E(G)\), then the function \(f\) is called graceful colouring for \(G\). The minimum number \(k\) such that \(f\) is a graceful colouring for \(G\) is called the graceful chromatic number of \(G\). The purpose of this research is to determine graceful chromatic number of Cartesian product graphs \(C_m \times P_n\) for integers \(m\geq 3\) and \(n\geq 2\), and \(C_m \times C_n\) for integers \(m,n\geq 3\). Here, \(C_m\) and \(P_m\) are cycle and path with \(m\) vertices, respectively. We found some exact values and bounds for graceful chromatic number of these mentioned Cartesian product graphs.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Cycle graph C_n"

1

Kurasov, Pavel. "Magnetic Boundary Control II: Graphs on One Cycle and Dependent Subtrees." In Operator Theory: Advances and Applications. Springer Berlin Heidelberg, 2023. http://dx.doi.org/10.1007/978-3-662-67872-5_23.

Full text
Abstract:
AbstractThe MBC-method as formulated in the previous chapter can only be applied to graphs with several independent cycles since it is required that dissolving vertices leads to at least two cycles being broken.
APA, Harvard, Vancouver, ISO, and other styles
2

Pu, Lianrong, and Haitao Jiang. "Can a Breakpoint Graph be Decomposed into None Other Than 2-Cycles?" In Frontiers in Algorithmics. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-39817-4_20.

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

Li, Jingming. "Using Text Understanding to Create Formatted Semantic Web from BIM." In Computational Design and Robotic Fabrication. Springer Nature Singapore, 2023. http://dx.doi.org/10.1007/978-981-19-8637-6_17.

Full text
Abstract:
AbstractThe application of BIM in the building life cycle needs to be continuous. The information collected and accumulated in the early stages should flow to the subsequent phases. However, BIM applications currently focus on collision inspection, compliance inspection, and engineering calculation, few models can be successively used in the following stages. Remodeling is required in the operation and maintenance period, resulting in waste. Meanwhile, some of the information accumulated by BIM might be frequently used in the operation and maintenance stage, while some data are relatively rarely used. The semantic web can help manage building information at all stages. But the generation of a semantic web is mostly manually completed. It is necessary to standardize the repeated semantic description in the model and convert BIM into a standard semantic model for information indexing, reducing the resource consumption of model loading and optimizing the efficiency of the operation and maintenance system. When the existing research transforms from BIM to the semantic web, there will be a lack of information and descriptions of the ownership relationship between entities due to the limitation of formats. To realize the standard transformation from BIM to the semantic web, this work proposes a method of using Natural Language Processing (NLP) to understand the text and infer the relationship between entities according to the knowledge map. First, the entities are extracted from BIM, such as air conditioning unit, electric lamp, fan, etc., if the name of the extracted entity is irregular, the names are translated with the help of NLP and Ontology (such as brick or haystack) to obtain the standard definition. By comparing the complete knowledge graph (such as the knowledge graph of the air conditioning system), the relationships can be deduced, and then a standardized semantic model can be generated.
APA, Harvard, Vancouver, ISO, and other styles
4

Read, Ronald C., and Robin J. Wilson. "Signed Graphs." In An Atlas Of Graphs. Oxford University PressOxford, 1998. http://dx.doi.org/10.1093/oso/9780198532897.003.0008.

Full text
Abstract:
Abstract A cycle in a signed graph is a positive cycle if the number of negative edges is even and is a negative cycle if the number of negative edges is odd. A signed graph is balanced if and only if each cycle is a positive cycle, and unbalanced otherwise; equivalently, a signed graph is balanced if we can colour each vertex red or green in such a way that positive edges have ends of the same colour and negative edges have ends of different colours. Signed graphs are used in the social sciences, with positive edges corresponding to positive relationships and negative edges corresponding to negative ones. Balanced signed graphs correspond to social situations in which there is no ‘tension’.
APA, Harvard, Vancouver, ISO, and other styles
5

Wilson, Robin. "6. Graphs." In Combinatorics: A Very Short Introduction. Oxford University Press, 2016. http://dx.doi.org/10.1093/actrade/9780198723493.003.0006.

Full text
Abstract:
Graph theory is about collections of points that are joined in pairs, such as a road map with towns connected by roads or a molecule with atoms joined by chemical bonds. ‘Graphs’ revisits the Königsberg bridges problem, the knight’s tour problem, the Gas–Water–Electricity problem, the map-colour problem, the minimum connector problem, and the travelling salesman problem and explains how they can all be considered as problems in graph theory. It begins with an explanation of a graph and describes the complete graph, the complete bipartite graph, and the cycle graph, which are all simple graphs. It goes on to describe trees in graph theory, Eulerian and Hamiltonian graphs, and planar graphs.
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

Read, Ronald C., and Robin J. Wilson. "Types Of Graph." In An Atlas Of Graphs. Oxford University PressOxford, 1998. http://dx.doi.org/10.1093/oso/9780198532897.003.0004.

Full text
Abstract:
Abstract Recall that a graph G is bipartite if its vertex set V can be partitioned into two sets X and Y so that each edge joins a vertex in X and a vertex in Y, and that G is Hamiltonian if it has a cycle that includes each vertex exactly once. G is an even graph if each vertex has even degree; thus, a connected even graph is an Eulerian graph. G is self-complementary if G is isomorphic to 1”5 complement; the number of vertices in a self-complementary graph must be of the form 4r or 4r + 1, where r is an integer. G is triangle-free if it has no cycles of length 3, and unicyclic if G contains only one cycle.
APA, Harvard, Vancouver, ISO, and other styles
8

Wilson, Robert A. "Other approaches to the four-colour problem." In Graphs, Colourings And The Four-Colour Theorem. Oxford University PressOxford, 2002. http://dx.doi.org/10.1093/oso/9780198510611.003.0005.

Full text
Abstract:
Abstract There is a surprising connection between map-colouring and Hamilton cycles. We need to stay with the face-colouring version of the four-colour conjecture to make this connection explicit. A Hamilton cycle is a cycle which includes each vertex exactly once (in other words, it is a spanning cycle). A graph is called Hamiltonian if it has a Hamilton cycle. The origin of this term was Hamilton’s ‘icosian game’ of 1857, whose object was to find such a cycle on the dodecahedron (see Fig. 5.1), although the general question of whether any given polyhedron possesses such a cycle was considered slightly earlier by Kirkman (see [31,32]). The idea of a Hamilton cycle can be traced back to 1759, when Euler introduced the knight’s tour problem, though not of course in graph-theoretical language.
APA, Harvard, Vancouver, ISO, and other styles
9

Ghai, Deepika, and Neelu Jain. "Signal Processing." In Research Advances in the Integration of Big Data and Smart Computing. IGI Global, 2016. http://dx.doi.org/10.4018/978-1-4666-8737-0.ch009.

Full text
Abstract:
Digital signal processing algorithms are recursive in nature. These algorithms are explained by iterative data-flow graphs where nodes represent computations and edges represent communications. For all data-flow graphs, time taken to achieve output from the applied input is referred as iteration bound. In this chapter, two algorithms are used for computing the iteration bound i.e. Longest Path Matrix (LPM) and Minimum Cycle Mean (MCM). The iteration bound of single-rate data-flow graph (SRDFG) can be determined by considering the Multi-rate data-flow graph (MRDFG) equivalent of the SRDFG. SRDFG contain more nodes and edges as compared to MRDFG. Reduction of nodes and edges in MRDFG is used for faster determination of the iteration bound.
APA, Harvard, Vancouver, ISO, and other styles
10

Acharya, Anal, Madhurima Ghosh, and Saran Jha. "Automated Detection and Removal of Cycles in a Concept Map." In Advancing Online Course Design and Pedagogy for the 21st Century Learning Environment. IGI Global, 2021. http://dx.doi.org/10.4018/978-1-7998-5598-9.ch016.

Full text
Abstract:
Over the years, concept maps have been used by several researchers to construct online learning systems. This is due to their flexibility in organizing knowledge. However, for effective use of concept maps in education, detection, and removal of cycles within them is necessary. Cycles in a concept map may result in ambiguity and confusion as one concept can lead back to itself. This study first gives brief details about concept maps and their applications in the field of education. A popular algorithm of graph theory depth-first search is then used for detection of cycles. If any cycles are found, they are removed from the graph in an iterative fashion until there are no more cycles in the graph. A Java program was written to simulate the proposed algorithm and found to yield desired results on sample graphs. Finally, the future uses of concept maps have been discussed.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Cycle graph C_n"

1

Klobas, Nina, and Matjaž Krnc. "Fast Recognition of Some Parametric Graph Families." In 7th Student Computer Science Research Conference. University of Maribor Press, 2021. http://dx.doi.org/10.18690/978-961-286-516-0.7.

Full text
Abstract:
Recognizing graphs with high level of symmetries is hard in general, and usually requires additional structural understanding. In this paper we study a particular graph parameter and motivate its usage by devising eÿcient recognition algorithm for the family of I-graphs. For integers m a simple graph is cycle regular if every path of length ` belongs to exactly cycles of length m. We identify all cycle regular I-graphs and, as a conse-quence, describe linear recognition algorithm for the observed family. Similar procedure can be used to devise the recog-nition algorithms for Double generalized Petersen graphs and folded cubes. Besides that, we believe the structural observations and methods used in the paper are of independent interest and could be used for solving other algorithmic problems.
APA, Harvard, Vancouver, ISO, and other styles
2

Nguyen Anh, Kiet, and Markus Ulbricht. "Preferred Reasoning in ABA by Cycle-Breaking." 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/390.

Full text
Abstract:
We develop a fixed-parameter tractable (FPT) algorithm for skeptical preferred reasoning in assumption-based argumentation (ABA). To this end we make use of so-called backdoors, i.e. sets of assumptions that need to be evaluated s.t. the remaining ABA framework (ABAF) belongs to a computational beneficial sub-class. In order to identify such target classes, we employ a suitable notion of a dependency graph of an ABAF. We show that these graphs can be constructed in polynomial time and that one can efficiently check sufficient properties ensuring that reasoning in the underlying ABAF is tractable. After establishing the theoretical foundations, we test our implementation against the ASPforABA solver which convincingly won the ABA track of the ICCMA'23 competition. As it turns out, our algorithm outperforms ASPforABA on instances with small backdoor sizes.
APA, Harvard, Vancouver, ISO, and other styles
3

Lonc, Zbigniew. "Approximating Fair Division on D-Claw-Free Graphs." In Thirty-Second International Joint Conference on Artificial Intelligence {IJCAI-23}. International Joint Conferences on Artificial Intelligence Organization, 2023. http://dx.doi.org/10.24963/ijcai.2023/315.

Full text
Abstract:
We study the problem of fair allocation of indivisible goods that form a graph and the bundles that are distributed to agents are connected subgraphs of this graph. We focus on the maximin share and the proportional fairness criteria. It is well-known that allocations satisfying these criteria may not exist for many graphs including complete graphs and cycles. Therefore, it is natural to look for approximate allocations, i.e., allocations guaranteeing each agent a certain portion of the value that is satisfactory to her. In this paper we consider the class of graphs of goods which do not contain a star with d+1 edges (where d &gt; 1) as an induced subgraph. For this class of graphs we prove that there is an allocation assigning each agent a connected bundle of value at least 1/d of her maximin share. Moreover, for the same class of graphs of goods, we show a theorem which specifies what fraction of the proportional share can be guaranteed to each agent if the values of single goods for the agents are bounded by a given fraction of this share.
APA, Harvard, Vancouver, ISO, and other styles
4

Shelton, Sam V., John P. Vodenicker, and Laura A. Schaefer. "Three-Dimensional Graphic Analysis of Absorption Cycles." In ASME 1999 International Mechanical Engineering Congress and Exposition. American Society of Mechanical Engineers, 1999. http://dx.doi.org/10.1115/imece1999-0821.

Full text
Abstract:
Abstract Due to new computer software tools and high speed personal computers, it is now possible to quickly analyze and optimize complex absorption heat pump cycles. These cycles utilize fluid mixtures and can have a large number of components. Absorption cycles are typically displayed on two-dimensional graphs, but these diagrams can cause confusion in understanding new cycle configurations and their potentials and limitations. This study uses three-dimensional graphs to create accurate representations of four cycles. In the advanced cycles, the many opportunities for internal heat recovery can be clearly seen. Additionally, the three-dimensional representations can justify the inclusion or removal of cycle components. They are an excellent tool for those new to the field to more quickly understand the cycles, and for those experienced with absorption to be innovative in developing new cycles.
APA, Harvard, Vancouver, ISO, and other styles
5

Zhou, Zhenxu, Hao Nie, Chunling Dong, and Qin Zhang. "Safety Analysis Model of DUCG Based on FMEA/FTA." In 2018 26th International Conference on Nuclear Engineering. American Society of Mechanical Engineers, 2018. http://dx.doi.org/10.1115/icone26-81484.

Full text
Abstract:
Failure Modes and Effects Analysis (FMEA) is a useful tool to find possible flaws, to reduce cost and to shorten research cycle in complex industrial systems. Fault Tree Analysis (FTA) has gained credibility over the past years, not only in nuclear industry, but also in other industries like aerospace, petrochemical, and weapon. Both FMEA and FTA are effective techniques in safety analysis, but there are still many uncertain factors in them that are not well addressed until now. This paper combines FMEA and FTA based on Dynamic Uncertain Causality Graph (DUCG) to solve this issue. Firstly, the FMEA model is mapped into a corresponding DUCG graph. Secondly, FTA model is mapped into a corresponding DUCG graph. Thirdly, combine the above DUCG graphs. Finally, users can modify the combined DUCG graph and calculations are made. This paper bridges the gap between FMEA and FTA by combining the two methods using DUCG. And additional modeling power and analytical power can be achieved with the advantages of the combined DUCG safety analysis model and its inference algorithm. This method can also promote the application of DUCG in the system reliability and safety analysis. An example is used to illustrate this method.
APA, Harvard, Vancouver, ISO, and other styles
6

Lonc, Zbigniew, and Miroslaw Truszczynski. "Maximin Share Allocations on Cycles." 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/57.

Full text
Abstract:
The problem of fair division of indivisible goods is a fundamental problem of social choice. Recently, the problem was extended to the setting when goods form a graph and the goal is to allocate goods to agents so that each agent's bundle forms a connected subgraph. Researchers proved that, unlike in the original problem (which corresponds to the case of the complete graph in the extended setting), in the case of the goods-graph being a tree, allocations offering each agent a bundle of or exceeding her maximin share value always exist. Moreover, they can be found in polynomial time. We consider here the problem of maximin share allocations of goods on a cycle. Despite the simplicity of the graph, the problem turns out be significantly harder than its tree version. We present cases when maximin share allocations of goods on cycles exist and provide results on allocations guaranteeing each agent a certain portion of her maximin share. We also study algorithms for computing maximin share allocations of goods on cycles.
APA, Harvard, Vancouver, ISO, and other styles
7

Steiner, Mark W. "Evaluation of Mechanical Product Architecture Using Interaction Graphs to Model Part Connectivity and Joint Strength." In ASME 1999 Design Engineering Technical Conferences. American Society of Mechanical Engineers, 1999. http://dx.doi.org/10.1115/detc99/dfm-8962.

Full text
Abstract:
Abstract Product performance, variety, manufacturability, logistics and life cycle ultimately depend upon product architecture. Product architecture includes both the foundations and building blocks upon which a mechanical system is conceived. It is a key element of Design for Manufacture (DFM). Until recently relatively little work has been done to fully understand these ramifications. A first step toward this goal is to better quantify the attributes of product architecture for mechanical assemblies. Using interaction graphs and the mathematics of graph theory, this paper proposes metrics for evaluating product architecture. These metrics can be developed from information derived from the geometric design domain based upon part connectivity and joint strengths.
APA, Harvard, Vancouver, ISO, and other styles
8

Lee, Hyeongok. "Design of new routing algorithm and embedding for Hierarchical Hypercube Networks." In AHFE 2023 Hawaii Edition. AHFE International, 2023. http://dx.doi.org/10.54941/ahfe1004204.

Full text
Abstract:
Mesh, hypercube, HHN, bubbls-sort, star, transposition, and macro-star graphs have been proposed as interconnection networks used in high-performance parallel computer structures. A hypercube expresses a node with n binary numbers, and has an edge between 1-bit other nodes. A hypercube is an excellent network from a graph-theoretic point of view, such as node symmetry, fault tolerance, recursive scalability, and Hamiltonian cycles. However, compared to the increase in the number of nodes, the number of edges increases proportionally, so the network cost is not good. The HHN graph was proposed as a network that improved the network cost by improving the disadvantages of the hypercube. HHN graph uses hypercube as a basic module. The HHN graph is a network that has improved network cost by designing it to have a hierarchical structure based on a hypercube. HHN graphs have a simple routing algorithm with fewer branches and fewer links than hypercubes. Although HHN's routing algorithm has a simple advantage, it has a disadvantage that the path length is long via unnecessary nodes. In this study, we propose a new routing algorithm that improves the path length of the HHN graph and analyze its efficiency. The improved routing algorithm proposed in this study has the result of improving the existing algorithm by 30% on average. In addition, we analyze the embedding of one interconnection network into another is a very important issue in the design and analysis of parallel algorithms. Through such embeddings the algorithms originally developed for one architecture can be directly mapped to another architecture. This paper describes novel methods for the embedding of hierarchical Hypercube networks in the hypercube to minimize the dilation and the expansion costs.
APA, Harvard, Vancouver, ISO, and other styles
9

Tauveron, N., S. Colasson, and J. A. Gruss. "Available Systems for the Conversion of Waste Heat to Electricity." In ASME 2014 International Mechanical Engineering Congress and Exposition. American Society of Mechanical Engineers, 2014. http://dx.doi.org/10.1115/imece2014-37984.

Full text
Abstract:
The conversion of heat into electricity, generally speaking heat-to-power generation, is a wide area of technologies and applications. This paper focuses on available systems, excepted the internal combustion cycles, applied to transform (waste) heat to power. Data of referenced market proved or time-to-market technologies are presented. A database of more than 1100 references has been built. The following categories can be found: Rankine Cycle plant, Organic Rankine Cycle plant, Steam engine, Kalina Cycle plant, Brayton cycle plant, micro gas turbine, closed cycle gas turbine plant, combined cycle gas turbine plant, Stirling engine, Ericsson engine and thermoelectric generator. We intentionally target a range of power from Watts to hundreds of MW, covering the range of temperature [80–1000°C] usually addressed by these systems. The comparison of performances is hereby discussed and compared to thermodynamic principles and theoretical results in the graph Maximum temperature [°C] versus Thermodynamic efficiency. Comparison with Carnot and Chambadal-Novikov-Curzon-Ahlborn efficiencies are performed. A more original contribution is the presentation of the graph Power [W] versus Thermodynamic efficiency. The analysis reveals a monotonous trend inside each technology. Furthermore this general behavior covers a very wide range of power, including technological transitions. Finally, the position of each technology in the map Maximum temperature [°C] versus Power [W] is also analyzed. Explanations based on thermodynamics and techno-economic approaches are proposed.
APA, Harvard, Vancouver, ISO, and other styles
10

Shinoda, Junichi, Olga Egorova, Haozhi Qu, and Ichiro Hagiwara. "Characteristic Topology Method for Quadrilateral Mesh Without Self-Intersection of Dual Cycles." In ASME 2002 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2002. http://dx.doi.org/10.1115/detc2002/cie-34470.

Full text
Abstract:
The Dual Cycle Elimination method was proposed by Mu¨ller-Hannemann for hexahedral mesh generation. The method begins with a surface quadrilateral mesh whose dual cycles have no self-intersections and, after the elimination of dual cycles, a hexahedral mesh is generated while tracing back the reverse order of eliminations and supplementing hexahedrons inside the object step by step. This paper presents the Characteristic Topology Method as a means to prescribe a quadrilateral surface mesh that can be initial data for further hexahedral mesh generation. The goal of this method is to stress the topology of the given surface and thus use construction of the loops within the algorithm. The surface is given in a nodal polygonal model and then decomposed into a triangle-quadrilateral model. Templates are used to determine the loops. Then due to some rules every loop is implemented by special additional Dual Cycles. The total mesh is the dual graph to the graph of dual cycles. The problem of self-intersections that may appear comes from Mu¨ller-Hannemann’s approach stated above and that is also implemented in this work as a sketch.
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Cycle graph C_n"

1

Baader, Franz. Least common subsumers, most specific concepts, and role-value-maps in a description logic with existential restrictions and terminological cycles. Technische Universität Dresden, 2002. http://dx.doi.org/10.25368/2022.125.

Full text
Abstract:
In a previous report we have investigates subsumption in the presence of terminological cycles for the description logic EL, which allows conjunctions, existential restrictions, and the top concept, and have shown that the subsumption problem remains polynomial for all three types of semantics usually considered for cyclic definitions in description logics. This result depends on a characterization of subsumption through the existence of certain simulation relations on the graph associated with a terminology. In the present report we will use this characterization to show how the most specific concept and the least common subsumer can be computed in EL with cyclic definitions. In addition, we show that subsumption in EL (with or without cyclic definitions) remains polynomial even if one adds a certain restricted form of global role-value-maps to EL. In particular, this kind of role-value-maps can express transitivity of roles.
APA, Harvard, Vancouver, ISO, and other styles
2

Baader, Franz. A Graph-Theoretic Generalization of the Least Common Subsumer and the Most Specific Concept in the Description Logic EL. Technische Universität Dresden, 2004. http://dx.doi.org/10.25368/2022.139.

Full text
Abstract:
In two previous papers we have investigates the problem of computing the least common subsumer (lcs) and the most specific concept (msc) for the description logic EL in the presence of terminological cycles that are interpreted with descriptive semantics, which is the usual first-order semantics for description logics. In this setting, neither the lcs nor the msc needs to exist. We were able to characterize the cases in which the lcs/msc exists, but it was not clear whether this characterization yields decidability of the existence problem. In the present paper, we develop a common graph-theoretic generalization of these characterizations, and show that the resulting property is indeed decidable, thus yielding decidability of the existence of the lcs and the msc. This is achieved by expressing the property in monadic second-order logic on infinite trees. We also show that, if it exists, then the lcs/msc can be computed in polynomial time.
APA, Harvard, Vancouver, ISO, and other styles
3

Kanner, Joseph, Edwin Frankel, Stella Harel, and Bruce German. Grapes, Wines and By-products as Potential Sources of Antioxidants. United States Department of Agriculture, 1995. http://dx.doi.org/10.32747/1995.7568767.bard.

Full text
Abstract:
Several grape varieties and red wines were found to contain large concentration of phenolic compounds which work as antioxidant in-vitro and in-vivo. Wastes from wine production contain antioxidants in large amounts, between 2-6% on dry material basis. Red wines but also white wines were found to prevent lipid peroxidation of turkey muscle tissues stored at 5oC. The antioxidant reaction of flavonoids found in red wines against lipid peroxidation were found to depend on the structure of the molecule. Red wine flavonoids containing an orthodihydroxy structure around the B ring were found highly active against LDL and membrane lipid peroxidation. The antioxidant activity of red wine polyphenols were also found to be dependent on the catalyzer used. In the presence of H2O2-activated myoglobin, the inhibition efficiency was malvidin 3-glucoside&gt;catechin&gt;malvidin&gt;resveratol. However, in the presence of an iron redox cycle catalyzer, the order of effectiveness was resveratol&gt;malvidin 3-glucoside = malvidin&gt;catechin. Differences in protein binding were found to affect antioxidant activity in inhibiting LDL oxidation. A model protein such as BSA, was investigated on the antioxidant activity of phenolic compounds, grape extracts, and red wines in a lecithin-liposome model system. Ferulic acid followed by malvidin and rutin were the most efficient in inhibiting both lipid and protein oxidation. Catechin, a flavonal found in red-wines in relatively high concentration was found to inhibit myoglobin catalyzed linoleate membrane lipid peroxidation at a relatively very low concentration. This effect was studied by the determination of the by-products generated from linoleate during oxidation. The study showed that hydroperoxides are catalytically broken down, not to an alcohol but most probably to a non-radical adduct. The ability of wine-phenolics to reduce iron and from complexes with metals were also demonstrated. Low concentration of wine phenolics were found to inhibit lipoxygenase type II activity. An attempt to understand the bioavailability in humans of antocyanins from red wine showed that two antocyanins from red wine were found unchanged in human urine. Other antocyanins seems to undergo molecular modification. In hypercholesterolemic hamsters, aortic lipid deposition was significantly less in animals fed diets supplemented with either catechin or vitamin E. The rate of LDL accumulation in the carotid arteries was also significantly lower in the catechin and vitamin E animal groups. These results suggested a novel mechanism by which wine phenolics are associated with decreased risk of coronary heart diseases. This study proves in part our hypothesis that the "French Paradox" could be explained by the action of the antioxidant effects of phenolic compounds found at high concentration in red wines. The results of this study argue that it is in the interest of public health to increase the consumption of dietary plant falvonoids. Our results and these from others, show that the consumption of red wine or plant derived polyphenolics can change the antioxidant tone of animal and human plasma and its isolated components towards oxidative reactions. However, we need more research to better understand bioavailability and the mechanism of how polyphenolics affect health and disease.
APA, Harvard, Vancouver, ISO, and other styles
4

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

Full text
Abstract:
Macroeconomic summary Annual inflation continued to rise in the first quarter (8.5%) and again outpaced both market expectations and the technical staff’s projections. Inflation in major consumer price index (CPI) baskets has accelerated year-to-date, rising in March at an annual rate above 3%. Food prices (25.4%) continued to contribute most to rising inflation, mainly affected by a deterioration in external supply and rising costs of agricultural inputs. Increases in transportation prices and in some utility rates (energy and gas) can explain the acceleration in regulated items prices (8.3%). For its part, the increase in inflation excluding food and regulated items (4.5%) would be the result of shocks in supply and external costs that have been more persistent than expected, the effects of indexation, accumulated inflationary pressures from the exchange rate, and a faster-than-anticipated tightening of excess productive capacity. Within the basket excluding food and regulated items, external inflationary pressures have meaningfully impacted on goods prices (6.4%), which have been accelerating since the last quarter of 2021. Annual growth in services prices (3.8%) above the target rate is due primarily to food away from home (14.1%), which was affected by significant increases in food and utilities prices and by a rise in the legal monthly minimum wage. Housing rentals and other services prices also increased, though at rates below 3%. Forecast and expected inflation have increased and remain above the target rate, partly due to external pressures (prices and costs) that have been more persistent than projected in the January report (Graphs 1.1 and 1.2). Russia’s invasion of Ukraine accentuated inflationary pressures, particularly on international prices for certain agricultural goods and inputs, energy, and oil. The current inflation projection assumes international food prices will increase through the middle of this year, then remain high and relatively stable for the remainder of 2022. Recovery in the perishable food supply is forecast to be less dynamic than previously anticipated due to high agricultural input prices. Oil prices should begin to recede starting in the second half of the year, but from higher levels than those presented in the previous report. Given the above, higher forecast inflation could accentuate indexation effects and increase inflation expectations. The reversion of a rebate on value-added tax (VAT) applied to cleaning and hygiene products, alongside the end of Colombia’s COVID-19 health emergency, could increase the prices of those goods. The elimination of excess productive capacity on the forecast horizon, with an output gap close to zero and somewhat higher than projected in January, is another factor to consider. As a consequence, annual inflation is expected to remain at high levels through June. Inflation should then decline, though at a slower pace than projected in the previous report. The adjustment process of the monetary policy rate wouldcontribute to pushing inflation and its expectations toward the target on the forecast horizon. Year-end inflation for 2022 is expected to be around 7.1%, declining to 4.8% in 2023. Economic activity again outperformed expectations. The technical staff’s growth forecast for 2022 has been revised upward from 4.3% to 5% (Graph 1.3). Output increased more than expected in annual terms in the fourth quarter of 2021 (10.7%), driven by domestic demand that came primarily because of private consumption above pre-pandemic levels. Investment also registered a significant recovery without returning to 2019 levels and with mixed performance by component. The trade deficit increased, with significant growth in imports similar to that for exports. The economic tracking indicator (ISE) for January and February suggested that firstquarter output would be higher than previously expected and that the positive demand shock observed at the end of 2021 could be fading slower than anticipated. Imports in consumer goods, retail sales figures, real restaurant and hotel income, and credit card purchases suggest that household spending continues to be dynamic, with levels similar to those registered at the end of 2021. Project launch and housing starts figures and capital goods import data suggest that investment also continues to recover but would remain below pre-pandemic levels. Consumption growth is expected to decelerate over the year from high levels reached over the last two quarters. This would come amid tighter domestic and external financial conditions, the exhaustion of suppressed demand, and a deterioration of available household income due to increased inflation. Investment is expected to continue to recover, while the trade deficit should tighten alongside high oil and other export commodity prices. Given all of the above, first-quarter economic growth is now expected to be 7.2% (previously 5.2%) and 5.0% for 2022 as a whole (previously 4.3%). Output growth would continue to moderate in 2023 (2.9%, previously 3.1%), converging similar to long-term rates. The technical staff’s revised projections suggest that the output gap would remain at levels close to zero on the forecast horizon but be tighter than forecast in January (Graph 1.4). These estimates continue to be affected by significant uncertainty associated with geopolitical tensions, external financial conditions, Colombia’s electoral cycle, and the COVID-19 pandemic. External demand is now projected to grow at a slower pace than previously expected amid increased global inflationary pressures, high oil prices, and tighter international financial conditions than forecast in January. The Russian invasion of Ukraine and its inflationary effects on prices for oil and certain agricultural goods and inputs accentuated existing global inflationary pressures originating in supply restrictions and increased international costs. A decline in the supply of Russian oil, low inventory levels, and continued production limits on behalf of the Organization of Petroleum Exporting Countries and its allies (OPEC+) can explain increased projected oil prices for 2022 (USD 100.8/barrel, previously USD 75.3) and 2023 (USD 86.8/barrel, previously USD 71.2). The forecast trajectory for the U.S. Federal Reserve (Fed) interest rate has increased for this and next year to reflect higher real and expected inflation and positive performance in the labormarket and economic activity. The normalization of monetary policy in various developed and emerging market economies, more persistent supply and cost shocks, and outbreaks of COVID-19 in some Asian countries contributed to a reduction in the average growth outlook for Colombia’s trade partners for 2022 (2.8%, previously 3.3%) and 2023 (2.4%, previously 2.6%). In this context, the projected path for Colombia’s risk premium increased, partly due to increased geopolitical global tensions, less expansionary monetary policy in the United States, an increase in perceived risk for emerging markets, and domestic factors such as accumulated macroeconomic imbalances and political uncertainty. Given all the above, external financial conditions are tighter than projected in January report. External forecasts and their impact on Colombia’s macroeconomic scenario continue to be affected by considerable uncertainty, given the unpredictability of both the conflict between Russia and Ukraine and the pandemic. The current macroeconomic scenario, characterized by high real inflation levels, forecast and expected inflation above 3%, and an output gap close to zero, suggests an increased risk of inflation expectations becoming unanchored. This scenario offers very limited space for expansionary monetary policy. Domestic demand has been more dynamic than projected in the January report and excess productive capacity would have tightened more quickly than anticipated. Headline and core inflation rose above expectations, reflecting more persistent and important external shocks on supply and costs. The Russian invasion of Ukraine accentuated supply restrictions and pressures on international costs. This partly explains the increase in the inflation forecast trajectory to levels above the target in the next two years. Inflation expectations increased again and are above 3%. All of this increased the risk of inflation expectations becoming unanchored and could generate indexation effects that move inflation still further from the target rate. This macroeconomic context also implies reduced space for expansionary monetary policy. 1.2 Monetary policy decision Banco de la República’s board of directors (BDBR) continues to adjust its monetary policy. In its meetings both in March and April of 2022, it decided by majority to increase the monetary policy rate by 100 basis points, bringing it to 6.0% (Graph 1.5).
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!