Relevant bibliographies by topics / Produits graphés / Dissertations / Theses
To see the other types of publications on this topic, follow the link: Produits graphés.

Dissertations / Theses on the topic 'Produits graphés'

Author: Grafiati
Published: 4 June 2021
Last updated: 4 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 dissertations / theses for your research on the topic 'Produits graphés.'

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.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

Genevois, Anthony. "Cubical-like geometry of quasi-median graphs and applications to geometric group theory." Thesis, Aix-Marseille, 2017. http://www.theses.fr/2017AIXM0569/document.

Full text
Abstract:
La classe des graphes quasi-médians est une généralisation des graphes médians, ou de manière équivalente, des complexes cubiques CAT(0). L'objectif de cette thèse est d'introduire ces graphes dans le monde de la théorie géométrique des groupes. Dans un premier temps, nous étendons la notion d'hyperplan définie dans les complexes cubiques CAT(0), et nous montrons que la géométrie d'un graphe quasi-médian se réduit essentiellement à la combinatoire de ses hyperplans. Dans la deuxième partie de notre texte, qui est le cœur de la thèse, nous exploitons la structure particulière des hyperplans pou
APA, Harvard, Vancouver, ISO, and other styles
2

Ostermeier, Lydia. "(Relaxed) Product Structures of Graphs and Hypergraphs." Doctoral thesis, Universitätsbibliothek Leipzig, 2015. http://nbn-resolving.de/urn:nbn:de:bsz:15-qucosa-167934.

Full text
Abstract:
In this thesis, we investigate graphs and hypergraphs that have (relaxed) product structures. In the class of graphs, we discuss in detail \\emph{RSP-relations}, a relaxation of relations fulfilling the square property and therefore of the product relation $\\sigma$, that identifies the copies of the prime factors of a graph w.r.t. the Cartesian product. For $K_{2,3}$-free graphs finest RSP-relations can be computed in polynomial-time. In general, however, they are not unique and their number may even grow exponentially. Explicit constructions of such relations in complete and complete bipa
APA, Harvard, Vancouver, ISO, and other styles
3

Gravier, Sylvain. "Coloration et produits de graphes." Université Joseph Fourier (Grenoble), 1996. http://www.theses.fr/1996GRE10084.

Full text
Abstract:
Dans la première partie, nous étudions la notion de coloration par listes. Un graphe d'ordre n est k-liste colorable si, quelque soit la donnée de n listes de taille k (une par sommet), il est possible d'attribuer, à chaque sommet, une couleur de sa liste, de sorte que deux sommets voisins quelconques aient des couleurs différentes. Nous donnons un rappel des différents résultats classiques sur la coloration par liste. Nous abordons l'aspect de la complexité du problème de liste-coloration. Après une étude des différentes constructions utilisées en théorie des graphes (contraction, identificat
APA, Harvard, Vancouver, ISO, and other styles
4

Zighem, Ismail. "Etude d'invariants de graphes planaires." Université Joseph Fourier (Grenoble), 1998. http://www.theses.fr/1998GRE10211.

Full text
Abstract:
Dans la première partie, nous construisons, à partir de relations linéaires de récurrence, des invariants de graphes planaires 4-réguliers prenant leurs valeurs dans un anneau commutatif. Ces relations représentent des règles récursives bien définies sur cette catégories de graphes, ramenant le calcul des valeurs de l'invariant en ces graphes à une combinaison linéaire d'autres graphes plus réduits. Après avoir dégagé quelques conditions nécessaires pour que ces règles soient mutuellement compatibles, nous montrons en utilisant un résultat de la théorie des systèmes de réécriture qu'elles sont
APA, Harvard, Vancouver, ISO, and other styles
5

Ward, David Charles. "Topics in finite groups : homology groups, pi-product graphs, wreath products and cuspidal characters." Thesis, University of Manchester, 2015. https://www.research.manchester.ac.uk/portal/en/theses/topics-in-finite-groups-homology-groups-piproduct-graphs-wreath-products-and-cuspidal-characters(7e90d219-fba7-4ff0-9071-c624acab7aaf).html.

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

Janaqi, Stefan. "Quelques éléments de la géométrie des graphes : graphes médians, produits d'arbres, génération convexe des graphes de Polymino." Université Joseph Fourier (Grenoble), 1994. http://www.theses.fr/1995GRE10093.

Full text
Abstract:
La notion d'intervalle dans un graphe, traduit de façon naturelle la notion du segment dans les espaces euclidiens. Par analogie, un ensemble C de sommets est convexe si pour tout couple x, y de sommets de C, l'intervalle entre x et y est inclu dans C. En utilisant la convexité géodésique, Djokovic a caractérisé les graphes isométriquement plongeable dans l'hypercube. Une vingtaine d'années plus tard, Mulder a caractérisé les graphes médians comme des graphes isométriquement plongeable dans l'hypercube et qui sont fermés pour l'opération médian. La comprehension du lien apparent entre ces deux
APA, Harvard, Vancouver, ISO, and other styles
7

Tardif, Claude. "Homomorphismes, produits et points fixes dans les graphes." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1997. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp04/nq26742.pdf.

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

Kuziak, Dorota. "Strong resolvability in product graphs." Doctoral thesis, Universitat Rovira i Virgili, 2014. http://hdl.handle.net/10803/285336.

Full text
Abstract:
En aquesta tesi s'estudia la dimensió mètrica forta de grafs producte. Els resultats més importants de la tesi se centren en la recerca de relacions entre la dimensió mètrica forta de grafs producte i la dels seus factors, juntament amb altres invariants d'aquests factors. Així, s'han estudiat els següents productes de grafs: producte cartesià, producte directe, producte fort, producte lexicogràfic, producte corona, grafs unió, suma cartesiana, i producte arrel, d'ara endavant "grafs producte". Hem obtingut fórmules tancades per la dimensió mètrica forta de diverses famílies no trivials de
APA, Harvard, Vancouver, ISO, and other styles
9

Minton, Gregory. "Dot Product Representations of Graphs." Scholarship @ Claremont, 2008. https://scholarship.claremont.edu/hmc_theses/209.

Full text
Abstract:
We introduce the concept of dot product representations of graphs, giving some motivations as well as surveying the previously known results. We extend these representations to more general fields, looking at the complex numbers, rational numbers, and finite fields. Finally, we study the behavior of dot product representations in field extensions.
APA, Harvard, Vancouver, ISO, and other styles
10

Whisenant, Christopher. "Parity Domination in Product Graphs." VCU Scholars Compass, 2011. http://scholarscompass.vcu.edu/etd/2522.

Full text
Abstract:
An odd open dominating set of a graph is a subset of the graph’s vertices with the property that the open neighborhood of each vertex in the graph contains an odd number of vertices in the subset. An odd closed r-dominating set is a subset of the graph’s vertices with the property that the closed r-ball centered at each vertex in the graph contains an odd number of vertices in the subset. We first prove that the n-fold direct product of simple graphs has an odd open dominating set if and only if each factor has an odd open dominating set. Secondly, we prove that the n-fold strong product of si
APA, Harvard, Vancouver, ISO, and other styles
11

Kumwenda, Khumbo. "Codes, graphs and designs related to iterated line graphs of complete graphs." Thesis, University of the Western Cape, 2011. http://etd.uwc.ac.za/index.php?module=etd&action=viewtitle&id=gen8Srv25Nme4_1742_1320645699.

Full text
Abstract:
In this thesis, we describe linear codes over prime fields obtained from incidence designs of iterated line graphs of complete graphs Li(Kn) where i = 1, 2. In the binary case, results are extended to codes from neighbourhood designs of the line graphs Li+1(Kn) using certain elementary relations. Codes from incidence designs of complete graphs, Kn, and neighbourhood designs of their line graphs, L1(Kn) (the so-called triangular graphs), have been considered elsewhere by others. We consider codes from incidence designs of L1(Kn) and L2(Kn), and neighbourhood designs of L2(Kn) and L3(Kn). In eac
APA, Harvard, Vancouver, ISO, and other styles
12

Turner, Bethany. "Embeddings of Product Graphs Where One Factor is a Hypercube." VCU Scholars Compass, 2011. http://scholarscompass.vcu.edu/etd/2455.

Full text
Abstract:
Voltage graph theory can be used to describe embeddings of product graphs if one factor is a Cayley graph. We use voltage graphs to explore embeddings of various products where one factor is a hypercube, describing some minimal and symmetrical embeddings. We then define a graph product, the weak symmetric difference, and illustrate a voltage graph construction useful for obtaining an embedding of the weak symmetric difference of an arbitrary graph with a hypercube.
APA, Harvard, Vancouver, ISO, and other styles
13

Payet, Etienne. "Produit Synchronisé pour Quelques Classes de Graphes Infinis." Phd thesis, Université de la Réunion, 2000. http://tel.archives-ouvertes.fr/tel-00468099.

Full text
Abstract:
Cette thèse a pour cadre la spécification et la vérification de systèmes informatiques distribués, concurrents ou réactifs au moyen de graphes infinis associés à des spécifications de Thue et à certaines machines. Nous montrons que la classe des graphes des spécifications de Thue est fermée par produit synchronisé. Nous établissons aussi ce fait pour la classe des graphes des machines de Turing et pour certaines de ses sous-classes. Nous nous intéressons également à la conservation par produit synchronisé de la décidabilité de la théorie du premier ordre de graphes infinis. Nous montrons que l
APA, Harvard, Vancouver, ISO, and other styles
14

Fish, Washiela. "Codes from uniform subset graphs and cycle products." Thesis, University of the Western Cape, 2007. http://etd.uwc.ac.za/index.php?module=etd&action=viewtitle&id=gen8Srv25Nme4_6789_1249271085.

Full text
Abstract:
<p>In this thesis only Binary codes are studied. Firstly, the codes overs the field GF(2) by the adjacency matrix of the complement T(n), ofthe triangular graph, are examined. It is shown that the code obtained is the full space F2 s(n/2) when n= 0 (mod 4) and the dual code of the space generated by the j-vector when n= 2(mod 4). The codes from the other two cases are less trivial: when n=1 (mod 4) the code is [(n 2), (n 2 ) - n + 1, 3] code, and when n = 3 (mod 4) it is an [(n 2), (n 2) - n, 4 ] code.</p>
APA, Harvard, Vancouver, ISO, and other styles
15

Cheney, Stephen R. "Domination Numbers of Semi-strong Products of Graphs." VCU Scholars Compass, 2015. http://scholarscompass.vcu.edu/etd/3989.

Full text
Abstract:
This thesis examines the domination number of the semi-strong product of two graphs G and H where both G and H are simple and connected graphs. The product has an edge set that is the union of the edge set of the direct product of G and H together with the cardinality of V(H), copies of G. Unlike the other more common products (Cartesian, direct and strong), the semi-strong product is neither commutative nor associative. The semi-strong product is not supermultiplicative, so it does not satisfy a Vizing like conjecture. It is also not submultiplicative so it shares these two properties with th
APA, Harvard, Vancouver, ISO, and other styles
16

Wu, Qiong. "Distance two labeling of some products of graphs." HKBU Institutional Repository, 2013. http://repository.hkbu.edu.hk/etd_ra/1487.

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

Norge, Morgan. "Kings in the Direct Product of Digraphs." VCU Scholars Compass, 2019. https://scholarscompass.vcu.edu/etd/6088.

Full text
Abstract:
A k-king in a digraph D is a vertex that can reach every other vertex in D by a directed path of length at most k. A king is a vertex that is a k-king for some k. We will look at kings in the direct product of digraphs and characterize a relationship between kings in the product and kings in the factors. This is a continuation of a project in which a similar characterization is found for the cartesian product of digraphs, the strong product of digraphs, and the lexicographic product of digraphs.
APA, Harvard, Vancouver, ISO, and other styles
18

Finbow, Stephen. "Graph parameters and products." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape9/PQDD_0018/MQ49351.pdf.

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

Green, Elisabeth Ruth. "Graph products of groups." Thesis, University of Leeds, 1990. http://etheses.whiterose.ac.uk/236/.

Full text
Abstract:
In the 1970's Baudisch introduced the idea of the semifree group, that is, a group in which the only relators are commutators of generators. Baudisch was mainly concerned with subgroup problems, employing length arguments on the elements of these groups. More recently Droms and Servatius have continued the study of semifree, or graph groups, as they call them. They answer some of the questions left open by the work of Baudisch. It is possible to take the graph analogy a level higher and study graph products of groups, which not only generalise graph groups, but also free and direct products. I
APA, Harvard, Vancouver, ISO, and other styles
20

Bailey, Sean. "To Dot Product Graphs and Beyond." DigitalCommons@USU, 2016. https://digitalcommons.usu.edu/etd/5029.

Full text
Abstract:
We will introduce three new classes of graphs; namely bipartite dot product graphs, probe dot product graphs, and combinatorial orthogonal graphs. All of these representations were inspired by a vector representation known as a dot product representation. Given a bipartite graph G = (X, Y, E), the bipartite dot product representation of G is a function ƒ : X ∪ Y → Rk and a positive threshold t such that for any κ ∈ Χ and γ ∈ Υ , κγ ∈ ε if and only if f(κ) · f(γ) ≥ t. The minimum k such that a bipartite dot product representation exists for G is the bipartite dot product dimension of G, denoted
APA, Harvard, Vancouver, ISO, and other styles
21

Al-Bashabsheh, Ali. "Normal Factor Graphs." Thèse, Université d'Ottawa / University of Ottawa, 2014. http://hdl.handle.net/10393/30659.

Full text
Abstract:
This thesis introduces normal factor graphs under a new semantics, namely, the exterior function semantics. Initially, this work was motivated by two distinct lines of research. One line is ``holographic algorithms,'' a powerful approach introduced by Valiant for solving various counting problems in computer science; the other is ``normal graphs,'' an elegant framework proposed by Forney for representing codes defined on graphs. The nonrestrictive normality constraint enables the notion of holographic transformations for normal factor graphs. We establish a theorem, called the generalized Ho
APA, Harvard, Vancouver, ISO, and other styles
22

Le, coz Corentin. "Separation and Poincaré profiles Separation profiles, isoperimetry, growth and compression Poincaré profiles of lamplighter diagonal products." Thesis, université Paris-Saclay, 2020. http://www.theses.fr/2020UPASM014.

Full text
Abstract:
Ce manuscrit de thèse récapitule mes travaux de recherche sur les profils de séparation et de Poincaré. Le profil de séparation est apparu en 2012 dans un l'article fondateur de Benjamini, Schramm et Timár. La définition donnée tirait ses origines dans des travaux antérieurs, dans le domaine du calcul formel : principalement des études de Lipton et Trajan concernant les graphes planaires, et de Miller, Teng, Thurston et Vavasis concernant des graphes d'intersection. Le profil de séparation est maintenant utilisé en théorie géométrique des groupes, mon domaine de recherche, à cause de sa propri
APA, Harvard, Vancouver, ISO, and other styles
23

Ratel, Sébastien. "Densité, VC-dimension et étiquetages de graphes." Electronic Thesis or Diss., Aix-Marseille, 2019. http://www.theses.fr/2019AIXM0427.

Full text
Abstract:
Une partie des résultats de cette thèse sont initialement motivés par l'élaboration de schémas d'étiquetage permettant de réponde à l'adjacence, à la distance ou au routage. Ce document traite cependant de problèmes d'intérêt plus généraux tels que l'étude de bornes sur la densité de graphes, de la VC-dimension de familles d'ensembles, ou de propriétés métriques et structurelles.Nous établissons dans un premier temps des bornes supérieures sur la densité des sous-graphes de produits cartésien de graphes, puis des sous-graphes de demi-cubes. Pour ce faire, nous définissons des extensions du par
APA, Harvard, Vancouver, ISO, and other styles
24

Culp, Laura. "An Isomorphism Theorem for Graphs." VCU Scholars Compass, 2009. http://scholarscompass.vcu.edu/etd/1952.

Full text
Abstract:
In the 1970’s, L. Lovász proved that two graphs G and H are isomorphic if and only if for every graph X , the number of homomorphisms from X → G equals the number of homomorphisms from X → H . He used this result to deduce cancellation properties of the direct product of graphs. We develop a result analogous to Lovász’s theorem, but in the class of graphs without loops and with weak homomorphisms. We apply it prove a general cancellation property for the strong product of graphs.
APA, Harvard, Vancouver, ISO, and other styles
25

Mullican, Cristina. "Characterizing Cancellation Graphs." VCU Scholars Compass, 2014. http://scholarscompass.vcu.edu/etd/3412.

Full text
Abstract:
A cancellation graph G is one for which given any graph C, we have G\times C\cong X\times C implies G\cong X. In this thesis, we characterize all bipartite cancellation graphs. In addition, we characterize all solutions X to G\times C\cong X\times C for bipartite G. A characterization of non-bipartite cancellation graphs is yet to be found. We present some examples of solutions X to G\times C\cong X\times C for non-bipartite G, an example of a non-bipartite cancellation graph, and a conjecture regarding non-bipartite cancellation graphs.
APA, Harvard, Vancouver, ISO, and other styles
26

Bailey, Sean. "Dot Product Graphs and Their Applications to Ecology." DigitalCommons@USU, 2013. https://digitalcommons.usu.edu/etd/2006.

Full text
Abstract:
During the past few decades, examinations of social, biological, and communication networks have taken on increased attention. While numerous models of these networks have arisen, some have lacked visual representations. This is particularly true in ecology, where scientists have often been restricted to at most three dimensions when creating graphical representations of pattern and process. I will introduce an application of dot product representation graphs that allows scientists to view the high dimensional connections in ecological networks. Using actual data, example graphs will be develo
APA, Harvard, Vancouver, ISO, and other styles
27

Turner, Nicole. "Tropical Arithmetics and Dot Product Representations of Graphs." DigitalCommons@USU, 2015. https://digitalcommons.usu.edu/etd/4460.

Full text
Abstract:
In tropical algebras we substitute min or max for the typical addition and then substitute addition for multiplication. A dot product representation of a graph assigns each vertex of the graph a vector such that two edges are adjacent if and only if the dot product of their vectors is greater than some chosen threshold. The resultS of creating dot product representations of graphs using tropical algebras are examined. In particular we examine the tropical dot product dimensions of graphs and establish connections to threshold graphs and the threshold dimension of a graph.
APA, Harvard, Vancouver, ISO, and other styles
28

Laurence, Michael Rupen. "Automorphisms of graph products of groups." Thesis, Queen Mary, University of London, 1992. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.412581.

Full text
Abstract:
Let r be a graph with vertex set V and for every v E V let Gv be a group with present ation (Sv I Rv). Let E ~ V X V be the set of pairs of adj acent vertices. Then we define the group G = Gr to be the group with presentation G = (SvVv E VI R; Vv E V, [Sv, SVI] = 1 iff (v,v') E E). In [2, LEMMA 3.3] it is shown that up to isomorphism G is independent of the choice of presentation of each group Gv. We call the group G a graph product of groups. Graph products include as special cases free products and direct products, corresponding to the graph G being dixcrete and complete respectively. If the
APA, Harvard, Vancouver, ISO, and other styles
29

Goda, Keith Martin. "Centralisers in graph products of groups." Thesis, University of Newcastle Upon Tyne, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.432489.

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

Alharthy, Shathaa. "De Bruijn Graphs and Lamplighter Groups." Thesis, Université d'Ottawa / University of Ottawa, 2019. http://hdl.handle.net/10393/38832.

Full text
Abstract:
De Bruijn graphs were originally introduced for finding a superstring representation for all fixed length words of a given finite alphabet. Later they found numerous applications, for instance, in DNA sequencing. Here we study a relationship between de Bruijn graphs and the family of lamplighter groups (a particular class of wreath products). We show how de Bruijn graphs and their generalizations can be presented as Cayley and Schreier graphs of lamplighter groups.
APA, Harvard, Vancouver, ISO, and other styles
31

Niedzialomski, Amanda Jean. "Consecutive radio labelings and the Cartesian product of graphs." Diss., University of Iowa, 2013. https://ir.uiowa.edu/etd/4886.

Full text
Abstract:
For k∈{Z}+ and G a simple connected graph, a k-radio labeling f:VG→Z+ of G requires all pairs of distinct vertices u and v to satisfy |f(u)-f(v)|≥ k+1-d(u,v). When k=1, this requirement gives rise to the familiar labeling known as vertex coloring for which each vertex of a graph is labeled so that adjacent vertices have different "colors". We consider k-radio labelings of G when k=diam(G). In this setting, no two vertices can have the same label, so graphs that have radio labelings of consecutive integers are one extreme o
APA, Harvard, Vancouver, ISO, and other styles
32

Hellmuth, Marc. "Local Prime Factor Decomposition of Approximate Strong Product Graphs." Doctoral thesis, Universitätsbibliothek Leipzig, 2010. http://nbn-resolving.de/urn:nbn:de:bsz:15-qucosa-38755.

Full text
Abstract:
In practice, graphs often occur as perturbed product structures, so-called approximate graph products. The practical application of the well-known prime factorization algorithms is therefore limited, since most graphs are prime, although they can have a product-like structure. This work is concerned with the strong graph product. Since strong product graphs G contain subgraphs that are itself products of subgraphs of the underlying factors of G, we follow the idea to develop local approaches that cover a graph by factorizable patches and then use this information to derive the global factors.
APA, Harvard, Vancouver, ISO, and other styles
33

Appelt, Eric Andrew. "On the Bandwidth of a Product of Complete Graphs." Miami University / OhioLINK, 2003. http://rave.ohiolink.edu/etdc/view?acc_num=miami1043425640.

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

Jacob, Jobby. "Variations on graph products and vertex partitions." Connect to this title online, 2009.

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

Ferov, Michal. "Separability properties of graph products of groups." Thesis, University of Southampton, 2015. https://eprints.soton.ac.uk/384000/.

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

González, Yero Ismael. "Contribution to the study of alliances in graphs." Doctoral thesis, Universitat Rovira i Virgili, 2010. http://hdl.handle.net/10803/8489.

Full text
Abstract:
Contribution to the study of alliances in graphs.<br/><br/>Resumen<br/><br/><br/>En este trabajo se estudian propiedades matemáticas de las alianzas (defensivas, ofensivas y duales) en grafos. Entre los temas tratados se destacan los siguientes:<br/><br/>· Se estudian las alianzas en grafos producto. Específicamente, se obtienen relaciones entre las alianzas en grafos producto Cartesiano y las alianzas en los factores. <br/>· Se estudia las particiones de un grafo en alianzas. En particular, se hacen estimaciones del número máximo de conjuntos pertenecientes a una partición del grafo en k-alia
APA, Harvard, Vancouver, ISO, and other styles
37

Sankaranarayanan, Sundararajan. "Iterative Decoding of Codes on Graphs." Diss., The University of Arizona, 2006. http://hdl.handle.net/10150/194618.

Full text
Abstract:
The growing popularity of a class of linear block codes called the low-density parity-check (LDPC) codes can be attributed to the low complexity of the iterative decoders, and their potential to achieve performance very close to the Shannon capacity. This makes them an attractive candidate for ECC applications in communication systems. This report proposes methods to systematically construct regular and irregular LDPC codes.A class of regular LDPC codes are constructed from incidence structures in finite geometries like projective geometry and affine geometry. A class of irregular LDPC codes a
APA, Harvard, Vancouver, ISO, and other styles
38

Mokhtarian, Hossein. "Modélisation intégrée produit-process à l'aide d'une approche de métamodélisation reposant sur une représentation sous forme de graphes : Application à la fabrication additive." Thesis, Université Grenoble Alpes (ComUE), 2019. http://www.theses.fr/2019GREAI013/document.

Full text
Abstract:
La fabrication additive (FA) a initié un changement de paradigme dans le secteur de la conception et de la fabrication des produits grâce à ses capacités uniques. Cependant, l'intégration des technologies de fabrication additive dans la productique traditionnelle doit permettre d'assurer une production fiable et une qualité reproductible des pièces. Dans cette optique, la modélisation et la simulation jouent un rôle essentiel pour améliorer la compréhension de la nature complexe et multi-physique des procédés de fabrication additive. De plus, l’intégration simultanée de différents modèles mult
APA, Harvard, Vancouver, ISO, and other styles
39

Vasylieva, Inna. "Very Cost Effective Partitions in Graphs." Digital Commons @ East Tennessee State University, 2013. https://dc.etsu.edu/etd/1137.

Full text
Abstract:
For a graph G=(V,E) and a set of vertices S, a vertex v in S is said to be very cost effective if it is adjacent to more vertices in V -S than in S. A bipartition pi={S, V- S} is called very cost effective if both S and V- S are very cost effective sets. Not all graphs have a very cost effective bipartition, for example, the complete graphs of odd order do not. We consider several families of graphs G, including Cartesian products and cacti graphs, to determine whether G has a very cost effective bipartition.
APA, Harvard, Vancouver, ISO, and other styles
40

Young, Stephen J. "Random dot product graphs a flexible model for complex networks." Diss., Atlanta, Ga. : Georgia Institute of Technology, 2008. http://hdl.handle.net/1853/26548.

Full text
Abstract:
Thesis (Ph.D)--Mathematics, Georgia Institute of Technology, 2009.<br>Committee Chair: Mihail, Milena; Committee Member: Lu, Linyuan; Committee Member: Sokol, Joel; Committee Member: Tetali, Prasad; Committee Member: Trotter, Tom; Committee Member: Yu, Xingxing. Part of the SMARTech Electronic Thesis and Dissertation Collection.
APA, Harvard, Vancouver, ISO, and other styles
41

Bottreau, Anne. "Réécritures de graphe et calculs distribués." Bordeaux 1, 1997. http://www.theses.fr/1997BOR10551.

Full text
Abstract:
Les systemes de reecriture de graphe sont un outil de modelisation d'algorithmes distribues sur un reseau de processeurs communicant. Dans ce modele, le reseau est represente par un graphe etiquete dont les sommets sont les processeurs, et les aretes les liens. Les etiquettes representent les etats (des processeurs et des liens). Un pas de reecriture sur un graphe etiquete consiste en la modification de l'etiquetage d'un sous-graphe connexe. Les reecritures sont donc locales, en ce sens elles sont un exemple de calculs locaux dans les graphes. Nous poursuivons l'etude des limitations du formal
APA, Harvard, Vancouver, ISO, and other styles
42

Kuhn, Simon. "Critical design within the practice of graphic design." Thesis, Nelson Mandela Metropolitan University, 2012. http://hdl.handle.net/10948/d1007843.

Full text
Abstract:
Critical Design is a specific type of design activity that has emerged from within the field of product design. Based on the supposition that design is an ideological activity, it can either be critical or affirmative of the status quo and categorised as Critical Design or Affirmative Design. The intention of this study is to create Critical Design within the practice of graphic design. Critical Design was defined by identifying its key characteristics and then visualised into a diagram that maps the pathways, processes and consequences which distinguish Critical Design from Affirmative Design
APA, Harvard, Vancouver, ISO, and other styles
43

Gardner, Bradley. "Italian Domination on Ladders and Related Products." Digital Commons @ East Tennessee State University, 2018. https://dc.etsu.edu/etd/3509.

Full text
Abstract:
An Italian dominating function on a graph $G = (V,E)$ is a function such that $f : V \to \{0,1,2\}$, and for each vertex $v \in V$ for which $f(v) = 0$, we have $\sum_{u\in N(v)}f(u) \geq 2$. The weight of an Italian dominating function is $f(V) = \sum_{v\in V(G)}f(v)$. The minimum weight of all such functions on a graph $G$ is called the Italian domination number of $G$. In this thesis, we will consider Italian domination in various types of products of a graph $G$ with the complete graph $K_2$. We will find the value of the Italian domination number for ladders, specific families of prisms,
APA, Harvard, Vancouver, ISO, and other styles
44

Cooper, Jeffrey R. "Product Dimension of a Random Graph." Miami University / OhioLINK, 2010. http://rave.ohiolink.edu/etdc/view?acc_num=miami1272038833.

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

Wong, Fook Sun. "Full friendly index sets of Cartesian products of cycles and paths." HKBU Institutional Repository, 2010. http://repository.hkbu.edu.hk/etd_ra/1239.

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

Chassaniol, Arthur. "Contributions à l'étude des groupes quantiques de permutations." Thesis, Clermont-Ferrand 2, 2016. http://www.theses.fr/2016CLF22709/document.

Full text
Abstract:
Dans cette thèse nous étudions le groupe quantique d’automorphismes des graphes finis, introduit par Banica et Bichon. Dans un premier temps nous montrerons un théorème de structure du groupe quantique d’automorphismes du produit lexicographique de deux graphes finis réguliers, qui généralise un résultat classique de Sabidussi. Ce théorème donne une condition nécessaire et suffisante pour que ce groupe quantique s’exprime comme le produit en couronne libre des groupes quantiques d’automorphismes de ces deux graphes. Dans un deuxième temps, nous expliciterons certaines améliorations de résultat
APA, Harvard, Vancouver, ISO, and other styles
47

Silva, Leila Roling Scariot da. "Sobre alianças defensivas e ofensivas globais em alguns produtos de grafos e grafos simpliciais." Universidade Federal de Goiás, 2015. http://repositorio.bc.ufg.br/tede/handle/tede/5310.

Full text
Abstract:
Submitted by Cláudia Bueno (claudiamoura18@gmail.com) on 2016-03-04T16:57:18Z No. of bitstreams: 2 Tese - Leila Roling Scariot da Silva - 2015.pdf: 821704 bytes, checksum: afe6afd0f3cea67708178512b59c2c09 (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5)<br>Approved for entry into archive by Luciana Ferreira (lucgeral@gmail.com) on 2016-03-07T12:10:47Z (GMT) No. of bitstreams: 2 Tese - Leila Roling Scariot da Silva - 2015.pdf: 821704 bytes, checksum: afe6afd0f3cea67708178512b59c2c09 (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5)<
APA, Harvard, Vancouver, ISO, and other styles
48

Cappelle, Márcia Rodrigues. "Sobre grafos com r tamanhos diferentes de conjuntos independentes maximais e algumas extensões." Universidade Federal de Goiás, 2014. http://repositorio.bc.ufg.br/tede/handle/tede/4475.

Full text
Abstract:
Submitted by Luciana Ferreira (lucgeral@gmail.com) on 2015-04-30T13:50:06Z No. of bitstreams: 2 Tese - Márcia Rodrigues Cappelle Santana - 2014.pdf: 631835 bytes, checksum: 92e31eb230a1e5640350250db336b352 (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5)<br>Approved for entry into archive by Luciana Ferreira (lucgeral@gmail.com) on 2015-04-30T13:54:17Z (GMT) No. of bitstreams: 2 Tese - Márcia Rodrigues Cappelle Santana - 2014.pdf: 631835 bytes, checksum: 92e31eb230a1e5640350250db336b352 (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (
APA, Harvard, Vancouver, ISO, and other styles
49

Pinquié, Romain. "Proposition d'un environnement numérique dédié à la fouille et à la synthèse collaborative d'exigences en ingénierie de produits." Thesis, Paris, ENSAM, 2016. http://www.theses.fr/2016ENAM0030/document.

Full text
Abstract:
Il est communément admis que 70 % des coûts du cycle de vie d’un produit sont engagés dès la phase de spécification. Or, aujourd’hui, dans chacune des relations contrac-tuelles client-fournisseur, le fournisseur doit faire face à un amas d’exigences à partir duquel il est difficile de prendre des décisions stratégiques avisées. Pour aider les sous-traitants, nous proposons une méthode outillée de synthèse des exigences, laquelle est supportée par un environnement numérique basé sur les sciences des données. Des modèles de classification extraient les exigences des documents. Les exigences sont
APA, Harvard, Vancouver, ISO, and other styles
50

Baumrt, Tomáš. "Vizualizace jako jeden z faktorů prodávající produkty a služby." Master's thesis, Vysoká škola ekonomická v Praze, 2009. http://www.nusl.cz/ntk/nusl-10355.

Full text
Abstract:
This diploma thesis deals with a subject of taking advantage of visualization during the process of product presentation. Its main aim is to find out, if visual presentation (design) of the product cover affects consumer's behaviour during the decision process of buying a particular product. If this influence is proven, a second goal is set up, namely detection of effects of chosen factors of visual presentation on consumer's decision process. Diploma thesis is divided into 6 chapters. The first introduces the topic to the reader and familiarize him with the goals and structure. Second chapter
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the bibliographies on the topic 'Produits graphés' for other source types:
Journal articles Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography