Zaloguj się

Gotowe bibliografie tematyczne / Odd parity path decomposition

Spis treści

Artykuły w czasopismach
Streszczenia konferencji
Raporty organizacyjne

Gotowa bibliografia na temat „Odd parity path decomposition”

Autor: Grafiati

Data publikacji: 3 czerwca 2025

Data aktualizacji: 31 lipca 2025

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Odd parity path decomposition”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Artykuły w czasopismach na temat "Odd parity path decomposition"

1

Petruševski, Mirko, and Riste Škrekovski. "Coverability of Graphs by Parity Regular Subgraphs." Mathematics 9, no. 2 (2021): 182. http://dx.doi.org/10.3390/math9020182.

Pełny tekst źródła

Streszczenie:

A graph is even (resp. odd) if all its vertex degrees are even (resp. odd). We consider edge coverings by prescribed number of even and/or odd subgraphs. In view of the 8-Flow Theorem, a graph admits a covering by three even subgraphs if and only if it is bridgeless. Coverability by three odd subgraphs has been characterized recently [Petruševski, M.; Škrekovski, R. Coverability of graph by three odd subgraphs. J. Graph Theory 2019, 92, 304–321]. It is not hard to argue that every acyclic graph can be decomposed into two odd subgraphs, which implies that every graph admits a decomposition into

Style APA, Harvard, Vancouver, ISO itp.

2

M., Sudha. "ARITHMETIC ODD DECOMPOSITION OF GRAPHS." Journal of Applied Mathematics and Statistical Analysis 4, no. 1 (2023): 8–13. https://doi.org/10.5281/zenodo.7817544.

Pełny tekst źródła

Streszczenie:

<em>The most important area in graph theory is graph decomposition [10]. Graph decomposition was first introduced by the mathematician Konig in 1960.Graph decomposition usually means collection of edge disjoint subgraphs such that each edge is appropriate to accurately unique. If every contains a trail or a cycle formerly we usually named it as path decomposition or cycle decomposition [1,6,9]. N. Gnana Dhas and J. Paul Raj Joseph [7] modified Ascending Subgraph Decomposition and introduced the concept known as Continous Monotonic Decomposition of graphs for connected graphs. An essential and

Style APA, Harvard, Vancouver, ISO itp.

3

de Souza, Jeferson, Saulo Pomponet Oliveira, and Francisco José Fonseca Ferreira. "Using parity decomposition for interpreting magnetic anomalies from dikes having arbitrary dip angles, induced and remanent magnetization." GEOPHYSICS 85, no. 3 (2020): J51—J58. http://dx.doi.org/10.1190/geo2019-0225.1.

Pełny tekst źródła

Streszczenie:

We have developed a technique to reconstruct the magnetic anomaly due to a dike in a way that the effect of magnetization direction is removed, resulting in a new totally symmetric anomaly. The reconstruction algorithm is easy to implement and could avoid the need of reduction to the pole at a low computational cost. The method is based on the decomposition of the function representing magnetic anomalies due to dikes in its even and odd parts. After applying a Hilbert transform to the odd components, we reconstruct the signal by a weighted average of the even part and the Hilbert-transformed o

Style APA, Harvard, Vancouver, ISO itp.

4

Prabhu, A., A. Brandenburg, M. J. Käpylä, and A. Lagg. "Helicity proxies from linear polarisation of solar active regions." Astronomy & Astrophysics 641 (September 2020): A46. http://dx.doi.org/10.1051/0004-6361/202037614.

Pełny tekst źródła

Streszczenie:

Context. The α effect is believed to play a key role in the generation of the solar magnetic field. A fundamental test for its significance in the solar dynamo is to look for magnetic helicity of opposite signs both between the two hemispheres as well as between small and large scales. However, measuring magnetic helicity is compromised by the inability to fully infer the magnetic field vector from observations of solar spectra, caused by what is known as the π ambiguity of spectropolarimetric observations. Aims. We decompose linear polarisation into parity-even and parity-odd E and B polarisa

Style APA, Harvard, Vancouver, ISO itp.

5

Kovács, Gergely, Benedek Nagy, Gergely Stomfai, Neşet Deniz Turgay, and Béla Vizvári. "Discrete Optimization: The Case of Generalized BCC Lattice." Mathematics 9, no. 3 (2021): 208. http://dx.doi.org/10.3390/math9030208.

Pełny tekst źródła

Streszczenie:

Recently, operations research, especially linear integer-programming, is used in various grids to find optimal paths and, based on that, digital distance. The 4 and higher-dimensional body-centered-cubic grids is the nD (n≥4) equivalent of the 3D body-centered cubic grid, a well-known grid from solid state physics. These grids consist of integer points such that the parity of all coordinates are the same: either all coordinates are odd or even. A popular type digital distance, the chamfer distance, is used which is based on chamfer paths. There are two types of neighbors (closest same parity a

Style APA, Harvard, Vancouver, ISO itp.

6

KAUFMANN, RALPH M. "PATH SPACE DECOMPOSITIONS FOR THE VIRASORO ALGEBRA AND ITS VERMA MODULES." International Journal of Modern Physics A 10, no. 07 (1995): 943–61. http://dx.doi.org/10.1142/s0217751x95000462.

Pełny tekst źródła

Streszczenie:

Starting from a detailed analysis of the structure of path spaces of the [Formula: see text] fusion graphs and the corresponding irreducible Virasoro algebra quotients V(c, h) for the (2, q odd) models, we introduce the notion of an admissible path space representation. The path spaces [Formula: see text] over the [Formula: see text] graphs are isomorphic to the path spaces over Coxeter A graphs that appear in FB models. We give explicit construction algorithms for admissible representations. From the finite-dimensional results of these algorithms we derive a decomposition of V(c, h) into its

Style APA, Harvard, Vancouver, ISO itp.

7

KANG, ROSS J., and FRANÇOIS PIROT. "Distance Colouring Without One Cycle Length." Combinatorics, Probability and Computing 27, no. 5 (2018): 794–807. http://dx.doi.org/10.1017/s0963548318000068.

Pełny tekst źródła

Streszczenie:

We consider distance colourings in graphs of maximum degree at most d and how excluding one fixed cycle of length ℓ affects the number of colours required as d → ∞. For vertex-colouring and t ⩾ 1, if any two distinct vertices connected by a path of at most t edges are required to be coloured differently, then a reduction by a logarithmic (in d) factor against the trivial bound O(dt) can be obtained by excluding an odd cycle length ℓ ⩾ 3t if t is odd or by excluding an even cycle length ℓ ⩾ 2t + 2. For edge-colouring and t ⩾ 2, if any two distinct edges connected by a path of fewer than t edges

Style APA, Harvard, Vancouver, ISO itp.

8

CHRISMAN, MICAH WHITNEY, and VASSILY OLEGOVICH MANTUROV. "PARITY AND EXOTIC COMBINATORIAL FORMULAE FOR FINITE-TYPE INVARIANTS OF VIRTUAL KNOTS." Journal of Knot Theory and Its Ramifications 21, no. 13 (2012): 1240001. http://dx.doi.org/10.1142/s0218216512400019.

Pełny tekst źródła

Streszczenie:

The present paper produces examples of Gauss diagram formulae for virtual knot invariants which have no analogue in the classical knot case. These combinatorial formulae contain additional information about how a subdiagram is embedded in a virtual knot diagram. The additional information comes from the second author's recently discovered notion of parity. For a parity of flat virtual knots, the new combinatorial formulae are Kauffman finite-type invariants. However, many of the combinatorial formulae possess exotic properties. It is shown that there exists an integer-valued virtualization inv

Style APA, Harvard, Vancouver, ISO itp.

9

Santoso, Jaya. "On the Chromatic Number of Cycle Books Graph." Compiler 14, no. 1 (2025): 27. https://doi.org/10.28989/compiler.v14i1.2930.

Pełny tekst źródła

Streszczenie:

Graph coloring is a fundamental topic in graph theory, with various applications in scheduling, networking, and optimization problems. In this study, we investigate the chromatic number of the cycle books graph , a structured graph formed by attaching multiple cycles to a common path . We establish that the chromatic number of depends on the parity of . Specifically, we prove that if is even, the chromatic number is , while if is odd, the chromatic number is . These results provide a deeper understanding of coloring properties in book-like graphs and contribute to the broader study of chromati

Style APA, Harvard, Vancouver, ISO itp.

10

Nosov, A. P., A. A. Akhrem, and V. Z. Rakhmankulov. "Efficiency Analysis of OLAP-data Hypercube Decomposition for Exponential Computational Complexity Methods." Mathematics and Mathematical Modeling, no. 3 (December 9, 2021): 29–45. http://dx.doi.org/10.24108/mathm.0321.0000258.

Pełny tekst źródła

Streszczenie:

The paper studies problems of reduction (decomposition) of OLAP-hypercube multidimensional data models. When decomposing large hyper-cubes of multidimensional data into sub-cube components the goal is to increase the computational performance of analytical OLAP systems, which is related to decreasing computational complexity of reduction methods for solving OLAP-data analysis problems with respect to the computational complexity of non-reduction methods, applied to data directly all over the hypercube. The paper formalizes the concepts of reduction and non-reduction methods and gives a definit

Style APA, Harvard, Vancouver, ISO itp.

Więcej źródeł

Streszczenia konferencji na temat "Odd parity path decomposition"

1

Mumey, Brendan, Samareh Shahmohammadi, Kathryn McManus, and Sean Yaw. "Parity Balancing Path Flow Decomposition and Routing." In 2015 IEEE Globecom Workshops (GC Wkshps). IEEE, 2015. http://dx.doi.org/10.1109/glocomw.2015.7414053.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Raporty organizacyjne na temat "Odd parity path decomposition"

1

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

Pełny tekst źródła

Streszczenie:

In the second quarter, annual inflation (9.67%), the technical staff’s projections and its expectations continued to increase, remaining above the target. International cost shocks, accentuated by Russia's invasion of Ukraine, have been more persistent than projected, thus contributing to higher inflation. The effects of indexation, higher than estimated excess demand, a tighter labor market, inflation expectations that continue to rise and currently exceed 3%, and the exchange rate pressures add to those described above. High core inflation measures as well as in the producer price index (PPI

Style APA, Harvard, Vancouver, ISO itp.

Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!