Academic literature on the topic 'N-part graph'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'N-part 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 "N-part graph"
1
Day, Maxwell Christopher, Frank Christopher Hawthorne, and Ali Rostami. "Bond topology of chain, ribbon and tube silicates. Part II. Geometrical analysis of infinite 1D arrangements of (TO4) n− tetrahedra." Acta Crystallographica Section A Foundations and Advances 80, no. 3 (2024): 258–81. http://dx.doi.org/10.1107/s2053273324002432.
Full textAbstract:
In Part I of this series, all topologically possible 1-periodic infinite graphs (chain graphs) representing chains of tetrahedra with up to 6–8 vertices (tetrahedra) per repeat unit were generated. This paper examines possible restraints on embedding these chain graphs into Euclidean space such that they are compatible with the metrics of chains of tetrahedra in observed crystal structures. Chain-silicate minerals with T = Si4+ (plus P5+, V5+, As5+, Al3+, Fe3+, B3+, Be2+, Zn2+ and Mg2+) have a grand nearest-neighbour 〈T–T〉 distance of 3.06±0.15 Å and a minimum T...T separation of 3.71 Å between non-nearest-neighbour tetrahedra, and in order for embedded chain graphs (called unit-distance graphs) to be possible atomic arrangements in crystals, they must conform to these metrics, a process termed equalization. It is shown that equalization of all acyclic chain graphs is possible in 2D and 3D, and that equalization of most cyclic chain graphs is possible in 3D but not necessarily in 2D. All unique ways in which non-isomorphic vertices may be moved are designated modes of geometric modification. If a mode (m) is applied to an equalized unit-distance graph such that a new geometrically distinct unit-distance graph is produced without changing the lengths of any edges, the mode is designated as valid (m v); if a new geometrically distinct unit-distance graph cannot be produced, the mode is invalid (m i). The parameters m v and m i are used to define ranges of rigidity of the unit-distance graphs, and are related to the edge-to-vertex ratio, e/n, of the parent chain graph. The program GraphT–T was developed to embed any chain graph into Euclidean space subject to the metric restraints on T–T and T...T. Embedding a selection of chain graphs with differing e/n ratios shows that the principal reason why many topologically possible chains cannot occur in crystal structures is due to violation of the requirement that T...T > 3.71 Å. Such a restraint becomes increasingly restrictive as e/n increases and indicates why chains with stoichiometry TO<2.5 do not occur in crystal structures.
2
Ghanbari, Nima, and Saeid Alikhani. "A graph related to the Euler ø function." Mathematical Gazette 107, no. 569 (2023): 263–72. http://dx.doi.org/10.1017/mag.2023.57.
Full textAbstract:
In mathematics, graph theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects. A graph G is a pair G = (V, E), where V and E are the vertex set and the edge set of G, respectively. The order and size of G is the number of vertices and edges of G, respectively. The degree or valency of a vertex u in a graph G (loopless), denoted by deg (u), is the number of edges meeting at u. If, for every vertex ν in G, deg (ν) = k, we say that G is a k-regular graph. The cycle of order n is denoted by Cn and is a connected 2-regular graph. The path graph of order n is denoted by Pn and obtain by deleting an edge of Cn. A tree is an undirected graph in which any two vertices are connected by exactly one path, or equivalently a connected undirected graph without cycle. A leaf (or pendant vertex) of a tree is a vertex of the tree of degree 1. An edge of a graph is said to be pendant if one of its vertices is a pendant vertex. A complete bipartite graph is a graph G with and such that every vertex of the set (part) X is connected to every vertex of the set (part) Y. If , then this graph is denoted by Km,n. The complete bipartite graph K1,n is called the star graph which has n + 1 vertices. The distance between two vertices u and ν of G, denoted by d (u, ν), is defined as the minimum number of edges of the walks between them. The complement of graph G is denoted by and is a graph with the same vertices such that two distinct vertices of are adjacent if, and only if, they are not adjacent in G. For more information on graphs, refer to [1].
3
LIN, YAW-LING, and STEVEN S. SKIENA. "COMPLEXITY ASPECTS OF VISIBILITY GRAPHS." International Journal of Computational Geometry & Applications 05, no. 03 (1995): 289–312. http://dx.doi.org/10.1142/s0218195995000179.
Full textAbstract:
In this paper, we consider two distinct problems related to complexity aspects of the visibility graphs of simple polygons. Recognizing visibility graphs is a long-standing open problem. It is not even known whether visibility graph recognition is in NP. That visibility graph recognition is in NP would be established if we could demonstrate that any n vertex visibility graph is realized by a polygon which can be drawn on an exponentially-sized grid. This motivates a study of the area requirements for realizing visibility graphs. In this paper, we prove: • Θ(n3) area is necessary and sufficient to realize the complete visibility graph Kn. • There exist visibility graphs which require exponential area to realize. • Any maximal outerplanar graph of diameter d can be realized in O(d2 · 2d) area, which can be as small as O(n log2 n) for a balanced mop. Linear maximal outer-planar graphs can be realized in O(n8) area. The second part of this paper considers the complexity of specific optimization problems on visibility graphs. Given a polygon P, we show that finding a maximum independent set, minimum vertex cover, or maximum dominating set in the visibility graph of P are all NP-complete. Further we show that for polygons P1 and P2, the problem of testing if they have isomorphic visibility graphs is isomorphism-complete. These problems remain hard when given the visibility graphs as input.
4
Xu, Chunyan, Rong Liu, Tong Zhang, Zhen Cui, Jian Yang, and Chunlong Hu. "Dual-Stream Structured Graph Convolution Network for Skeleton-Based Action Recognition." ACM Transactions on Multimedia Computing, Communications, and Applications 17, no. 4 (2021): 1–22. http://dx.doi.org/10.1145/3450410.
Full textAbstract:
In this work, we propose a dual-stream structured graph convolution network ( DS-SGCN ) to solve the skeleton-based action recognition problem. The spatio-temporal coordinates and appearance contexts of the skeletal joints are jointly integrated into the graph convolution learning process on both the video and skeleton modalities. To effectively represent the skeletal graph of discrete joints, we create a structured graph convolution module specifically designed to encode partitioned body parts along with their dynamic interactions in the spatio-temporal sequence. In more detail, we build a set of structured intra-part graphs, each of which can be adopted to represent a distinctive body part (e.g., left arm, right leg, head). The inter-part graph is then constructed to model the dynamic interactions across different body parts; here each node corresponds to an intra-part graph built above, while an edge between two nodes is used to express these internal relationships of human movement. We implement the graph convolution learning on both intra- and inter-part graphs in order to obtain the inherent characteristics and dynamic interactions, respectively, of human action. After integrating the intra- and inter-levels of spatial context/coordinate cues, a convolution filtering process is conducted on time slices to capture these temporal dynamics of human motion. Finally, we fuse two streams of graph convolution responses in order to predict the category information of human action in an end-to-end fashion. Comprehensive experiments on five single/multi-modal benchmark datasets (including NTU RGB+D 60, NTU RGB+D 120, MSR-Daily 3D, N-UCLA, and HDM05) demonstrate that the proposed DS-SGCN framework achieves encouraging performance on the skeleton-based action recognition task.
5
Zhong, Chuang, and Shuangliang Tian. "Neighbor Sum Distinguishing Edge (Total) Coloring of Generalized Corona Product." Journal of Physics: Conference Series 2381, no. 1 (2022): 012031. http://dx.doi.org/10.1088/1742-6596/2381/1/012031.
Full textAbstract:
Abstract The coloring theory of graphs is an important part of graph theory research. The key problem of the coloring theory of graphs is to determine the coloring number of each kind of coloring. Traditional coloring concepts mainly include proper vertex coloring, proper edge coloring, proper total coloring, and so on. In recent years, scholars at home and abroad have put forward some new coloring concepts, such as neighbor vertex distinguishing edge (total) coloring, and neighbor sum distinguishing edge (total) coloring, based on traditional coloring concepts and by adding other constraints. Some valuable results have been obtained, which further enrich the theory of graph coloring. For a proper [k]-edge coloring of a graph G, if for any adjacent vertex has a different sum of colors, then the coloring is a neighbor sum distinguishing [k]-edge coloring of G. For a proper [k]-total coloring of a graph G, if for any adjacent vertex has a different sum of colors, then the coloring is a neighbor sum distinguishing [k]-total coloring of G . In this paper, the coloring method and coloring index are determined by the process of induction and deduction and the construction of the dyeing method, and then the rationality of the method is verified by inverse proof and mathematical induction. If G is a simple graph with the order n ≥ 5 , and hn = (Hi ) i∈{1,2,…,n} is a sequence of disjoint simple graphs, where every Hi is a simple graph with the order m ≥ 7 . In this paper, we study the neighbor sum distinguishing edge(total) coloring of the generalized corona product G○hn of G and hn . The results are as follows: (1) If G is a path with order n , hn = (Hi ) i∈{1,2,…,n} is an alternating sequence of path and cycle with order m . If n is odd, we have χ Σ ′ ( G ∘ h n ) = m + 3 (2) If G is a path with order n , hn = (Hi ) i∈{1,2,…,n} is an alternating sequence of path and cycle with order m . If n is odd, we have χ Σ ′ ′ ( G ∘ h n ) = m + 4 Due to the late development of neighbor sum distinguishing edge (total) coloring of graphs, the related research results are relatively few. By studying the operation graph of a basic simple graph, we can provide the research basis and reference idea for the corresponding coloring of the general graph class. Therefore, it is of theoretical value to study the neighbor sum distinguishing edge (total) coloring problem of generalized corona products of graphs.
6
Sason, Igal. "Observations on graph invariants with the Lovász $ \vartheta $-function." AIMS Mathematics 9, no. 6 (2024): 15385–468. http://dx.doi.org/10.3934/math.2024747.
Full textAbstract:
<abstract><p>This paper delves into three research directions, leveraging the Lovász $ \vartheta $-function of a graph. First, it focuses on the Shannon capacity of graphs, providing new results that determine the capacity for two infinite subclasses of strongly regular graphs, and extending prior results. The second part explores cospectral and nonisomorphic graphs, drawing on a work by Berman and Hamud (2024), and it derives related properties of two types of joins of graphs. For every even integer such that $ n \geq 14 $, it is constructively proven that there exist connected, irregular, cospectral, and nonisomorphic graphs on $ n $ vertices, being jointly cospectral with respect to their adjacency, Laplacian, signless Laplacian, and normalized Laplacian matrices, while also sharing identical independence, clique, and chromatic numbers, but being distinguished by their Lovász $ \vartheta $-functions. The third part focuses on establishing bounds on graph invariants, particularly emphasizing strongly regular graphs and triangle-free graphs, and compares the tightness of these bounds to existing ones. The paper derives spectral upper and lower bounds on the vector and strict vector chromatic numbers of regular graphs, providing sufficient conditions for the attainability of these bounds. Exact closed-form expressions for the vector and strict vector chromatic numbers are derived for all strongly regular graphs and for all graphs that are vertex- and edge-transitive, demonstrating that these two types of chromatic numbers coincide for every such graph. This work resolves a query regarding the variant of the $ \vartheta $-function by Schrijver and the identical function by McEliece <italic>et al.</italic> (1978). It shows, by a counterexample, that the $ \vartheta $-function variant by Schrijver does not possess the property of the Lovász $ \vartheta $-function of forming an upper bound on the Shannon capacity of a graph. This research paper also serves as a tutorial of mutual interest in zero-error information theory and algebraic graph theory.</p></abstract>
7
Petrenjuk, Volodymyr, and Dmytro Petreniuk. "Models of Klein Surface Obstruction Graphs." Cybernetics and Computer Technologies, no. 1 (March 29, 2024): 47–63. http://dx.doi.org/10.34229/2707-451x.24.1.4.
Full textAbstract:
The task of researching the structure of graphs of given connectivity, which are obstructions for a given surface of non-oriented kind, and building their models, from which obstruction graphs are formed by removing or compressing a set of edges, is considered. The issue of edge coverage of an obstruction graph of a given kind with a minimum number of quasi-stars with centers – planar graphs that have given sets of points and all edges are significant with respect to the reachability number 2 on the Euclidean plane and has reachability on the projective plane or Klein surface, is considered. K4, K2,3 or a degenerate graph. The task of researching the structure of graphs of undirected kind was considered [4–6]. In [7], the set of minors for the projective plane was compressed to 12 basic minors using the method of relative components, and a set of 62 minors of the Klein surface was constructed. To do this, we considered all non-isomorphic minimal embeddings of each of the basic minors and found the set of all different pairs of vertices that are reachable on the projective plane during the operations of removing or compressing an arbitrary edge of this graph to a point, then a pair of non-adjacent graph vertices was attached to the selected pair of points. In [8], the number of 2-connected obstruction graphs for the Klein surface was calculated, part of the diagrams of these graphs is given in [10]. Note that the following definition of the cell distance is similar to that in [11].Our approach, as a continuation of [9], will consist in finding the edge covering of an obstruction graph of a given kind by the minimum number of subgraphs of the covering from the number of quasi-stars with centers - graphs with essential edges relative to the number of reachability or nonorientable genus during compression to a point or removal operations edges relative to a given set of points with reachability number 2 relative to the Euclidean plane and reachable on projective planes or Klein surfaces, for example, these are subsets of the set of points of graphs K4, K2,3, K5\e, Kr, r >= 2, or graph-obstructions of the projective plane. We also found the necessary conditions for constructing obstruction graphs for the Klein surface by identifying pairs of center points and hanging vertices of three quasi-stars, thus we have the basis of an algorithm for constructing a larger number of obstruction graphs for the Klein surface. Hypothetically, a graph-obstruction of a given nonorientable genus has the form of a cylindrical surface with n, n >= 2, disks-bases and a side part, which can have common sets of points on the boundaries and on which are embedded, at least in part, the graph-centers of quasi-stars having a given set of reachability points 2 on the Euclidean plane, and on the side surface there are hanging edges that intersect on the plane and are inserted without crossing with the help of Mobius strips glued to the side surface. At the same time, the edges will have at least two nesting options in the side part of the cylindrical surface, but no more than the number of glued Mobius strips, thanks to which each hanging edge will nest on the Mobius strip, either with only one edge or with two adjacent edges. We have found the necessary conditions for constructing models of obstruction graphs for the Klein surface by identifying pairs of centers and hanging vertices of three quasi-stars, thus we have the basis of an algorithm for constructing a larger number of obstruction graphs for the Klein surface. The main result: statements 1, 2, 3 and the algorithm for constructing models of 3-connected graph-obstructions of the Klein surface. Keywords: φ-transformation of graphs, nonorientable surface, prototypes of graph-obstruction.
8
Ikhlaq, Hafiz Muhammad, Hafiz Muhammad Afzal Siddiqui, and Muhammad Imran. "A Comparative Study of Three Resolving Parameters of Graphs." Complexity 2021 (December 15, 2021): 1–13. http://dx.doi.org/10.1155/2021/1927181.
Full textAbstract:
Graph theory is one of those subjects that is a vital part of the digital world. It is used to monitor the movement of robots on a network, to debug computer networks, to develop algorithms, and to analyze the structural properties of chemical structures, among other things. It is also useful in airplane scheduling and the study of diffusion mechanisms. The parameters computed in this article are very useful in pattern recognition and image processing. A number d f , w = min d w , t , d w , s is referred as distance between f = t s an edge and w a vertex. d w , f 1 ≠ d w , f 2 implies that two edges f 1 , f 2 ∈ E are resolved by node w ∈ V . A set of nodes A is referred to as an edge metric generator if every two links/edges of Γ are resolved by some nodes of A and least cardinality of such sets is termed as edge metric dimension, e dim Γ for a graph Γ . A set B of some nodes of Γ is a mixed metric generator if any two members of V ∪ E are resolved by some members of B . Such a set B with least cardinality is termed as mixed metric dimension, m dim Γ . In this paper, the metric dimension, edge metric dimension, and mixed metric dimension of dragon graph T n , m , line graph of dragon graph L T n , m , paraline graph of dragon graph L S T n , m , and line graph of line graph of dragon graph L L T n , m have been computed. It is shown that these parameters are constant, and a comparative analysis is also given for the said families of graphs.
9
BEDNARSKA-BZDȨGA, MAŁGORZATA, DAN HEFETZ, MICHAEL KRIVELEVICH, and TOMASZ ŁUCZAK. "Manipulative Waiters with Probabilistic Intuition." Combinatorics, Probability and Computing 25, no. 6 (2015): 823–49. http://dx.doi.org/10.1017/s0963548315000310.
Full textAbstract:
For positive integersnandqand a monotone graph property$\mathcal{A}$, we consider the two-player, perfect information game WC(n,q,$\mathcal{A}$), which is defined as follows. The game proceeds in rounds. In each round, the first player, called Waiter, offers the second player, called Client,q+ 1 edges of the complete graphKnwhich have not been offered previously. Client then chooses one of these edges which he keeps and the remainingqedges go back to Waiter. If, at the end of the game, the graph which consists of the edges chosen by Client satisfies the property$\mathcal{A}$, then Waiter is declared the winner; otherwise Client wins the game. In this paper we study such games (also known as Picker–Chooser games) for a variety of natural graph-theoretic parameters, such as the size of a largest component or the length of a longest cycle. In particular, we describe a phase transition type phenomenon which occurs when the parameterqis close tonand is reminiscent of phase transition phenomena in random graphs. Namely, we prove that ifq⩾ (1 + ϵ)n, then Client can avoid components of ordercϵ−2lnnfor some absolute constantc> 0, whereas forq⩽ (1 − ϵ)n, Waiter can force a giant, linearly sized component in Client's graph. In the second part of the paper, we prove that Waiter can force Client's graph to be pancyclic for everyq⩽cn, wherec> 0 is an appropriate constant. Note that this behaviour is in stark contrast to the threshold for pancyclicity and Hamiltonicity of random graphs.
10
Hamidi, Mohammad, and Irina Cristea. "Hyperideal-based zero-divisor graph of the general hyperring $ \mathbb{Z}_{n} $." AIMS Mathematics 9, no. 6 (2024): 15891–910. http://dx.doi.org/10.3934/math.2024768.
Full textAbstract:
<abstract><p>The aim of this paper is to introduce and study the concept of a hyperideal-based zero-divisor graph associated with a general hyperring. This is a generalized version of the zero-divisor graph associated with a commutative ring. For any general hyperring $ R $ having a hyperideal $ I $, the $ I $-based zero-divisor graph $ \Gamma^{(I)}(R) $ associated with $ R $ is the simple graph whose vertices are the elements of $ R\setminus I $ having their hyperproduct in $ I $, and two distinct vertices are joined by an edge when their hyperproduct has a non-empty intersection with $ I $. In the first part of the paper, we concentrate on some general properties of this graph related to absorbing elements, while the second part is dedicated to the study of the $ I $-based zero-divisor graph associated to the general hyperring $ \mathbb{Z}_n $ of the integers modulo $ n $, when $ n = 2p^mq $, with $ p $ and $ q $ two different odd primes, and fixing the hyperideal $ I $.</p></abstract>
Dissertations / Theses on the topic "N-part graph"
1
Montagner, Arnaldo Jovanini. "A estrutura de dados gema para representação de mapas n-dimensionais." [s.n.], 2007. http://repositorio.unicamp.br/jspui/handle/REPOSIP/276246.
Full textAbstract:
Orientador: Jorge Stolfi [Orientador]<br>Tese (doutorado) - Universidade Estadual de Campinas, Instituto de Computação.<br>Made available in DSpace on 2018-08-10T07:43:58Z (GMT). No. of bitstreams: 1
Montagner_ArnaldoJovanini_D.pdf: 2204093 bytes, checksum: 4c9c86ca0312f3b5507e1daa8c6553db (MD5)
Previous issue date: 2007<br>Resumo: Mapas são subdivisões de espaços topológicos em regiões simples, e triangulações são um tipo específico de mapa em que cada elemento é um simplexo (aresta, triângulo, tetraedro, etc). Neste trabalho, tratamos o problema de representação da topologia de triangulações e mapas de dimensão arbitrária. Estudamos a utilização de uma representação baseada em grafos de arestas coloridas, já utilizada como ferramenta teórica, mas nunca empregada em aplicações práticas. A principal limitação desta representação é a relativa inflexibilidade imposta sobre a manipulação da topologia. Há porém grandes vantagens em sua utilização, como a simplicidade de representação e a generalidade. Este trabalho consiste na especificação teórica de uma estrutura de dados baseada nestes grafos coloridos e de operações topológicas para construção e manipulação da estrutura. A utilização desta estrutura é ilustrada através de algoritmos para resolução de problemas em geometria computacional<br>Abstract: Maps are subdivisions of topological spaces into simple regions, and triangulations are a specific kind of map wherein each element is a simplex (edge, triangle, tetrahedron, etc). In this work, we analyze the problem of representing the topology of triangulations and maps with arbitrary dimension. We study a representation based on edge-colored graphs, already used as theoretical tool, but never employed in practical applications. The main limitation of this representation is the relative inexibility imposed on the manipulation of topology. There are, though, great advantages in its use, as its simplicity and generality. This work consists in the theoretic specification of a data structure based on these colored graphs and of topological operators to build and manipulate the structure.The use of this structure is illustrated by algorithms for computational geometry problems<br>Doutorado<br>Computação Grafica<br>Mestre em Ciência da Computação
2
Ghaemi, Mohammadreza. "Etude de la complexité algorithmique associée à des opérations de décomposition de graphes." Paris 6, 2008. http://www.theses.fr/2008PA066449.
Full textAbstract:
La thèse porte sur des problèmes de complexitè liés à des opération de décomposition de graphes. Etant donné un graphe donné H (clique, stable, biparti, graphe à seuil) et un graphe G n-apparié, on étudie la complexité algorithmique du problème suivant : Existe-t-il un sous-graphe induit de G qui contient exactement un sommet de chacune des n paires de G isomorphe à H?. On montrera enfin que le problème de décomposition des graphes appelés graphes Stubborn est équivalent au problème précédent pour un cas particulier de graphes n-appariés.
3
Sharma, Manish. "Receptores iterativos para canais de acesso múltiplo ruidosos com N frequências e T usuários." [s.n.], 2010. http://repositorio.unicamp.br/jspui/handle/REPOSIP/260834.
Full textAbstract:
Orientador: Jaime Portugheis<br>Tese (doutorado) - Universidade Estadual de Campinas, Faculdade de Engenharia Elétrica e de Computação<br>Made available in DSpace on 2018-08-17T00:51:09Z (GMT). No. of bitstreams: 1
Sharma_Manish_D.pdf: 1122815 bytes, checksum: ac184067a2eeb2f29617e0a5da608708 (MD5)
Previous issue date: 2010<br>Resumo: O objetivo deste trabalho é analisar o desempenho da recepção e detecção conjunta e iterativa para canais de acesso múltiplo. A análise se concentrou em torno de um canal ruidoso com N frequências compartilhado por T usuários. Encontramos valores para a capacidade do canal para detecção conjunta e individual. Embora a eficiência espectral do sistema seja relativamente baixa, a combinação deste fator com uma grande faixa de frequências permite altas taxas de transmissão com baixa relação sinal ruído. O receptor foi modelado como um grafo de fatores e foi analisado através de curvas EXIT, que também são utilizadas para otimizar os códigos corretores de erro dos usuários. Propomos alguns sistemas baseados nesta técnica e simulamos a sua probabilidade de erro de bit. Os resultados indicam que é possível transmitir informação com taxas próximas da capacidade do canal. Tanto o grafo do receptor como as análises subsequentes podem ser aplicadas para outros canais de acesso múltiplo, especialmente para sistemas com N símbolos de transmissão ortogonais.<br>Abstract: The aim of this work is to analyze the performance of iterative joint reception and detection for multi-user channels. The analysis is centered around an N-frequency MFSK noisy channel shared by T users. Channel capacity values are obtained for joint and single user detection. Although the system's spectral efficiency is low, high rates at low signal to noise ratio are achievable by using a wide-bandwidth channel. The receiver is modeled as a factor graph and analyzed by its EXIT charts, which were also used to analyze the users' error correcting codes. Some systems are proposed and simulated to obtain the bit error probability. Results indicate that it is possible to transmit information with rates close to channel capacity. The proposed receiver and the performed analysis can be applied to other types of multiple access channels, in particular for systems with N orthogonal transmission symbols.<br>Doutorado<br>Telecomunicações e Telemática<br>Doutor em Engenharia Elétrica
Books on the topic "N-part graph"
1
Tanasa, Adrian. Combinatorial Physics. Oxford University Press, 2021. http://dx.doi.org/10.1093/oso/9780192895493.001.0001.
Full textAbstract:
After briefly presenting (for the physicist) some notions frequently used in combinatorics (such as graphs or combinatorial maps) and after briefly presenting (for the combinatorialist) the main concepts of quantum field theory (QFT), the book shows how algebraic combinatorics can be used to deal with perturbative renormalisation (both in commutative and non-commutative quantum field theory), how analytic combinatorics can be used for QFT issues (again, for both commutative and non-commutative QFT), how Grassmann integrals (frequently used in QFT) can be used to proCve new combinatorial identities (generalizing the Lindström–Gessel–Viennot formula), how combinatorial QFT can bring a new insight on the celebrated Jacobian conjecture (which concerns global invertibility of polynomial systems) and so on. In the second part of the book, matrix models, and tensor models are presented to the reader as QFT models. Several tensor model results (such as the implementation of the large N limit and of the double-scaling limit for various such tensor models, N being here the size of the tensor) are then exposed. These results are natural generalizations of results extensively used by theoretical physicists in the study of matrix models and they are obtained through intensive use of combinatorial techniques (this time mainly enumerative techniques). The last part of the book is dedicated to the recently discovered relation between tensor models and the holographic Sachdev–Ye–Kitaev model, model which has been extensively studied in the last years by condensed matter and by high-energy physicists.
2
KJV Study Bible for Girls Grape/Surf Blue, Floral Design Duravella. Baker Books, 2016.
Find full textBook chapters on the topic "N-part graph"
1
Schiff, Krzysztof. "Partitioning of an M-Part Weighted Graph with N Vertices in Each Part into N Cliques with M Vertices and the Total Minimum Sum of Their Edges Weights Using Ant Algorithms." In Lecture Notes in Networks and Systems. Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-37720-4_24.
Full text
2
Ball, John, and Dominic Welsh. "Algebra In Graph Theory." In Graph Theory as I Have Known It. Oxford University PressOxford, 1998. http://dx.doi.org/10.1093/oso/9780198502517.003.0005.
Full textAbstract:
Abstract I learned a little Combinatorial Topology at Cambridge. That subject dealt with structures called “n-complexes”. These were made by fitting together units called “n-simplexes”, n-dimensional analogues of the point, the segment, the triangle and the tetrahedron. The graphs of Graph Theory appeared as the case n = 1, and by combinatorial topologists they were usually looked upon as trivialities. However O. Veblen devoted part of a textbook to them and to their associated maps on surfaces [108]. The topological textbook then favoured at Cambridge was that of Seifert and Threlfall [52].
3
Alhassan, Ahmad, and Auwal Aliyu. "The Principle of Interpretation of Gravity Data Using Second Vertical Derivative Method." In Gravitational Field - Concepts and Applications. IntechOpen, 2022. http://dx.doi.org/10.5772/intechopen.100443.
Full textAbstract:
This chapter is aimed at demonstrating how the second vertical derivative method is been applied to gravity data for subsurface delineation. Satellite gravity data of some part of Northern Nigeria that lie between latitude 11°–13°E and longitude 8°–14°N obtained from Bureau Gravimetrique International (BGI) were used for demonstration. The Bouguer graph was plotted using surfer software. The second vertical derivative graph was also plotted. Very low gravity anomalies are observed on the Bouguer map, which recommends the presence of sedimentary rocks which have low density. The result of the second vertical derivative method has improved weaker local anomalies, defined the edges of geologically anomalous density distributions, and identified geologic units. This is a clear implication that the second vertical derivative is very important in subsurface delineation.
4
Smith, Justin R. "Graph Algorithms." In The Design and Analysis of Parallel Algorithms. Oxford University PressNew York, NY, 1993. http://dx.doi.org/10.1093/oso/9780195078817.003.0026.
Full textAbstract:
Abstract Introduction. This section develops an algorithm for parsing precedence gram mars and the evaluation of an arithmetic expression in O(lg n) time. Although parts of this algorithm are somewhat similar to the doubling algorithms of the previous section, we put these algorithms in a separate section because of their complexity. They are interesting for a number of reasons.
5
Shaikh, Zulfa, and Poonam Garg. "Secure Multiparty Computing Protocol." In Interdisciplinary Perspectives on Business Convergence, Computing, and Legality. IGI Global, 2013. http://dx.doi.org/10.4018/978-1-4666-4209-6.ch012.
Full textAbstract:
Secure Multiparty Computation (SMC) can be defined as n number of parties who do joint computation on their inputs (x1, x2…xn) using some function F and want output in the form of y. The increase in sensitive data on a network raises concern about the security and privacy of inputs. During joint computation, each party wants to preserve the privacy of their inputs. Therefore, there is a need to define an efficient protocol that maintains privacy, security, and correctness parameters of SMC. In this chapter, an approach towards secure computation is provided and analyzed with security graphs.
Conference papers on the topic "N-part graph"
1
McMains, Sara, and Xiaorui Chen. "Determining Moldability and Parting Directions for Polygons With Curved Edges." In ASME 2004 International Mechanical Engineering Congress and Exposition. ASMEDC, 2004. http://dx.doi.org/10.1115/imece2004-62227.
Full textAbstract:
We consider the problem of whether a given geometry can be molded in a two part, rigid, reusable mold with opposite removal directions. We describe an efficient algorithm for solving the opposite direction moldability problem for a 2D “polygon” bounded by edges that may be either straight or curved. We introduce a structure, the normal graph of the polygon, that represents the range of normals of the polygon’s edges, along with their connectivity. We prove that the normal graph captures the directions of all lines corresponding to feasible parting directions. Rather than building the full normal graph, which could take time O(n log n) for a polygon bounded by n possibly curved edges, we build a summary structure in O(n) time and space, from which we can determine all feasible parting directions in time O(n).
2
Ranger, A. E. "Surface Structure of Coatings." In Papermaking Raw Materials, edited by V. Punton. Fundamental Research Committee (FRC), Manchester, 1985. http://dx.doi.org/10.15376/frc.1985.2.673.
Full textAbstract:
The positive intercept which appears on a graph of K and N ink absorption versus a function of absorption time has previously been interpreted as a measure of surface roughness. In the case of coated surfaces, evidence is offered that it is an indicator of a porous top layer of the coating with distinctly different properties from those of the main part of the coating. It is shown that the total void volume of this top layer depends on both the capillary suction exerted by the substrate and on the speed of drying of the coating and its pore size is intermediate between that of the substrate and the main coating layer.
3
Mota, Guilherme Oliveira. "Advances in anti-Ramsey theory for random graphs." In II Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2017. http://dx.doi.org/10.5753/etc.2017.3204.
Full textAbstract:
Dados grafos G e H, denotamos a seguinte propriedade por G ÝrÑpb H: para toda coloração própria das arestas de G (com uma quantidade arbitrária de cores) existe uma cópia multicolorida de H em G, i.e., uma cópia de H sem duas arestas da mesma cor. Sabe-se que, para todo grafo H, a função limiar prHb prHbpnq para essa propriedade no grafo aleatório binomial Gpn; pq é assintoticamente no máximo n 1{mp2qpHq, onde mp2qpHq denota a assim chamada 2-densidade máxima de H. Neste trabalho discutimos esse e alguns resultados recentes no estudo de propriedades anti-Ramsey para grafos aleatórios, e mostramos que se H C4 ou H K4 então prHb n 1{mp2qpHq, que está em contraste com os fatos conhecidos de que prCbk n 1{mp2qpCkq para Let r be a positive integer and let G and H be graphs. We denote by G Ñ pHqr the property that any colouring of the edges of G with at most r colours contains a monochromatic copy of H in G. In 1995, Ro¨dl and Rucin´ski determined the threshold for the property Gpn; pq Ñ pHqr for all graphs H. The maximum 2-density mp2qpHq of a graph H is denoted by mp2qpHq max ! ||VEppJJqq|| 12 : J H; |V pJ q| ¥ 3) ; where we suppose |V pHq| ¥ 3.
4
Kumar T. V., Sateesh, and S. Meenakshi. "Lucky labeling of jelly fish graph J(m, n), cocktail party graph CPk and crown graph Cn*." In 2ND INTERNATIONAL CONFERENCE ON MATHEMATICAL TECHNIQUES AND APPLICATIONS: ICMTA2021. AIP Publishing, 2022. http://dx.doi.org/10.1063/5.0108660.
Full text
5
You, Li. "Multi-party quantum correlation and entanglement." In Workshop on Entanglement and Quantum Decoherence. Optica Publishing Group, 2008. http://dx.doi.org/10.1364/weqd.2008.eas2.
Full textAbstract:
A characterization of the complete correlation structure in an n-party system is proposed in terms of a series of (k, n) threshold classical secret sharing protocols (2 ≤ k ≤ n). The total correlation is shown to be the sum of independent correlations of 2-, 3-,…, n-parties. Our result unifies several earlier scattered works, and shines new light at the important topic of multi-party quantum entanglement. As an application, we explicitly construct the hierarchy of correlations in an n-qubit graph state.
6
Gopalakrishnan, Praveen Kumare, Jeffery Cavallaro, Sogol Jahanbekam, and Sara Behdad. "A Graph Coloring Technique for Identifying the Minimum Number of Parts for Physical Integration in Product Design." In ASME 2019 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2019. http://dx.doi.org/10.1115/detc2019-98251.
Full textAbstract:
Abstract The objective of this study is to develop a mathematical framework for determining the minimum number of parts required in a product to satisfy a list of functional requirements (FRs) given a set of connections between FRs. The problem is modeled as a graph coloring technique in which a graph G with n nodes (representing the FRs) and m edges (representing the connections between the FRs) is studied to determine the graph’s chromatic number χ(G), which is the minimum number of colors required to properly color the graph. The chromatic number of the graph represents the minimum number of parts needed to satisfy the list of FRs. In addition, the study calculates the computational efficiency of the proposed algorithm. Several examples are provided to show the application of the proposed algorithm.
7
Oliveira, Rafael F., Vander L. S. Freitas, Gladston J. P. Moreira, and Eduardo J. S. Luz. "Explorando Redes Neurais de Grafos para Classificação de Arritmias." In Simpósio Brasileiro de Computação Aplicada à Saúde. Sociedade Brasileira de Computação - SBC, 2022. http://dx.doi.org/10.5753/sbcas.2022.222510.
Full textAbstract:
Arritmia cardíaca é uma condição de risco e seu diagnóstico precoce é de fundamental importância. Por isso, a automação do processo de identificação de arritmia é desejável. Neste contexto, um modelo de classificação automática de arritmias em sinais de eletrocardiograma (ECG) é proposto baseado em Graph Neural Network (GNN) e o batimento cardíaco representado por meio de um grafo via algoritmo Visibility Graph (VG). São avaliados três modelos de redes GNN: uma rede convolutional de grafos com duas camadas (GCN-2L), outra com três camadas (GCN-3L) e GraphSAGE (GraphSAGE-4L). Sob o paradigma interpatient, o modelo GraphSAGE-4L apresentou o melhor desempenho, obtendo F1-score médio de 0,86 para as classes N, S e V.
8
Avila, Caio Viktor S., and Vania Vidal. "LiRB: Um Navegador Leve Baseado em Texto para Knowledge Graphs RDF." In Anais Estendidos do Simpósio Brasileiro de Banco de Dados. Sociedade Brasileira de Computação - SBC, 2023. http://dx.doi.org/10.5753/sbbd_estendido.2023.232837.
Full textAbstract:
Neste artigo apresentamos LIght RDF Browser (LiRB), uma interface leve para a navegação interativa sobre Knowledge Graphs (KGs) RDF. LiRB apresenta uma interface Web baseada em texto, proporcionando uma experiência de navegação semelhante às páginas Web tradicionais, promovendo uma menor curva de aprendizagem aos usuários. Como diferenciais, LiRB utiliza consultas simples e rápidas, sendo ideal para a navegação de KGs massivos e/ou virtuais. Além disso, a ferramenta também permite a abstração de relacionamentos N-ários para representar a semântica de propriedades de relacionamentos, além da apresentação de consultas salvas. Por fim, LiRB também dá suporte ao recurso de exibição de timelines de eventos de recursos do KG.
9
Fasanelli, Roberto, Anna Liguori, and Ida Galli. "A Similarity Graph-based Approach to Study Social Representations of the Economic Crisis: A Comparison between Italian and Greek Social Groups." In International Association of Cross Cultural Psychology Congress. International Association for Cross-Cultural Psychology, 2016. http://dx.doi.org/10.4087/trkm7515.
Full textAbstract:
In order to analyse the common sense theories about the economic thinking and acting, this research has been conducted with the theoretical framework of the Social Representation Theory. By interviewing Italian and Greek participants belonging to different social groups, we examined how <em>expert</em> and <em>lay</em> people face this phenomenon. Inspired by the Structural Approach, which considers SRs as constituted of two parts (a structure and a content), data were collected through specific strategies and were created <em>ad</em> <em>hoc</em>: hierarchized evocations, characterization and multiple choice questionnaires. Four groups of participants (N=120 for each country; n=30 for each group; gender balanced) were employed: university students (second/third year; Faculty of economics), mid-level bank clerks, shopkeepers, and laypeople. Obtained data were treated with rang/frequency and similarity/ network analysis, as well as mono and bivariate statistical analysis. The main findings demonstrate culture and group membership differences in the ways participants define and foresee strategies to face the crisis. In particular, in both Italian and Greek samples, differences between <em>expert</em> and <em>lay</em> groups are clear. Methodological implications associated with combining qualitative and quantitative methods, in SRT’s Structural Approach, are presented and discussed.
10
Shrivastava, Parnika, J. J. Roy, M. K. Samal, P. K. Jain, and Puneet Tandon. "Parameter Optimization of Incremental Sheet Metal Forming Based on Taguchi Design and Response Surface Methodology." In ASME 2015 International Mechanical Engineering Congress and Exposition. American Society of Mechanical Engineers, 2015. http://dx.doi.org/10.1115/imece2015-51227.
Full textAbstract:
Incremental Sheet Forming (ISF) is a flexible and innovative rapid prototyping technique for the fabrication of limited sheet metal components. In the present investigation, the dependency of formability and thickness reduction of ISF parts on tool diameter, incremental step depth along with the preheating of sheet material has been determined. After preheating, initial grain size of the sheet material is selected as a parameter under study. Incremental Sheet Forming process has been studied using Taguchi design of experiments along with Response surface methodology (RSM). ANOVA, 3D surface graphs, S/N ratio and main effect plots have been analyzed. Results indicated that the initial grain size is the most significant parameter as far as forming load and thickness reduction is concerned in ISF. Preheating of the sheet material reduces forming load and favors homogenous thickness distribution. Response surface is optimized and a model developed can be used to predict forming load and thickness reduction within the limits of factors being studied.