Einloggen

Thematische Bibliographien / Construction de graphes / Zeitschriftenartikel

Zeitschriftenartikel zum Thema „Construction de graphes“

Um die anderen Arten von Veröffentlichungen zu diesem Thema anzuzeigen, folgen Sie diesem Link: Construction de graphes.

Autor: Grafiati

Veröffentlicht am 25. Mai 2024

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Machen Sie sich mit Top-50 Zeitschriftenartikel für die Forschung zum Thema "Construction de graphes" bekannt.

Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.

Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.

Sehen Sie die Zeitschriftenartikel für verschiedene Spezialgebieten durch und erstellen Sie Ihre Bibliographie auf korrekte Weise.

1

Díaz Villalba, Alejandro. „Comment outiller l’étude des autorités avec l’analyse de réseaux dans les grammaires françaises des XVI^e et XVII^e siècles“. SHS Web of Conferences 138 (2022): 03003. http://dx.doi.org/10.1051/shsconf/202213803003.

Der volle Inhalt der Quelle

Annotation:

L’article propose d’outiller, par le recours à l’analyse de réseaux, l’étude des références, c’est-à-dire les mentions et les citations d’autorités dans les textes métalinguistiques. Il s’agit, d’une part, de présenter les principes méthodologiques qui ont présidé à l’élaboration d’une visualisation sous forme de graphes de réseau : la modélisation et la construction d’une base de données de références et la génération du graphe dans un logiciel approprié. Il est question, d’autre part, de décrire les aspects liés à l’interprétation des graphes de réseaux, le but étant d’explorer le potentiel de l’outil dans l’histoire des idées linguistiques.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

2

Pigeon, Émilie. „Réseaux sociaux catholiques et construction identitaire dans les Pays d’en haut : l’exemple du fort Michilimackinac (1741-1821)“. Francophonies d'Amérique, Nr. 40-41 (08.03.2018): 83–112. http://dx.doi.org/10.7202/1043699ar.

Der volle Inhalt der Quelle

Annotation:

Cet article explore le rôle clé qu’ont joué les femmes dans la construction de réseaux sociaux catholiques en marge du commerce des fourrures dans les Pays d’en haut entre 1741 et 1821. Nous constatons que le rite du baptême au fort Michilimackinac devint à la fois un outil religieux et économique. En mariant l’histoire sociale aux humanités numériques, nous observons, par l’entremise de graphes, la construction de liens idéologiques et commerciaux au sein de nombreux réseaux sociaux historiques. Nous dépassons la métaphore du réseau en utilisant un logiciel d’analyse de réseaux sociaux (nommé visone) qui permet de voir et de comprendre comment une femme en particulier, Louise Dubois, se servit du catholicisme pour améliorer sa situation sociale dans la région des Grands Lacs. Les femmes autochtones et allochtones devinrent marraines à plusieurs reprises dans les Pays d’en haut. Ce faisant, elles tissèrent des liens stratégiques, se rapprochant des communautés autochtones avoisinantes grâce au baptême, premier sacrement d’initiation à la religion catholique.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

3

CHABI, Tayeb. „Identification des scenarios à la performance de l’entreprise par la productivité, rentabilité et compétitivité suivant le modèle Morphol : Cas d’un échantillon d’entreprise.“ Dirassat Journal Economic Issue 6, Nr. 1 (01.01.2015): 291–307. http://dx.doi.org/10.34118/djei.v6i1.547.

Der volle Inhalt der Quelle

Annotation:

L’objet de la présente recherche empirique est d’identifier les scénarios clés à la réalisation de la performance au d’une entreprise. L’étude est réalisée sur un échantillon d’entreprises de la région de la Soummam. Pour mener notre étude, nous avons élaboré un questionnaire pour formuler un champ d’hypothèses et leurs évaluations par les entreprises enquêtées, ensuite un champ utile de réponses est réalisé suivant le modèle « Morphol » GODET. M, (2001). Les résultats de notre enquête ont permis la construction d’un système de variables et d’indicateurs, la visualisation des résultats sur des graphes et des plans de proximité et ensuit procéder à leur analyse et à l’identification des scénarios clés à la performance dans les entreprises enquêtées.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

4

Garcia-Debanc, Claudine, Myriam Bras und Laure Vieu. „Annotation de la cohérence dans des textes d’élèves et jugements de cohérence d’enseignants du primaire“. SHS Web of Conferences 186 (2024): 03003. http://dx.doi.org/10.1051/shsconf/202418603003.

Der volle Inhalt der Quelle

Annotation:

Au croisement des tâches « cohérence » et « formation des enseignants » de l’ANR ECalm, cette contribution porte sur la cohérence de textes d’élèves d’école primaire et de début de collège. Elle met en regard des annotations discursives prenant appui sur une extension de la SDRT (Segmented Discourse Representation Theory) permettant l’annotation de points d’incohérence et des jugements de cohérence formulés par des enseignant.e.s du premier degré dans le cadre d’une session de formation continue. La cohérence est envisagée comme une propriété de la représentation de discours que se construit celui qui interprète le texte tout au long de sa lecture. Le corpus analysé est issu du corpus RESOLCO, l’un des corpus de textes scolaires collectés, transcrits et annotés dans le cadre de l’ANR E-Calm. Ce corpus est constitué de textes en réponse à une même consigne d’écriture : une tâche-problème demandant aux élèves la rédaction d’un texte narratif impliquant la résolution d’anaphores de divers types. Cette analyse comparative vise tout d’abord à mettre à l’épreuve le modèle d’annotation discursive. Les incohérences visualisées dans les représentations sémantiques issues de l’analyse linguistique sous forme de graphes sont également perçues par les enseignant.e.s confronté.e.s à la lecture de ces mêmes textes, ce qui permet de valider le modèle. L’analyse des échanges à l’intérieur d’un groupe d’enseignants fait apparaitre que l’un des deux dispositifs proposés favorise la mise en place chez les enseignants d’une posture de lecteur à la recherche de la construction de la cohérence et non d’évaluateur en référence à une norme linguistique et leur permet d’interroger les calculs interprétatifs permettant de formuler des jugements de cohérence. La présentation des graphes aux enseignant.e.s les aide ensuite à objectiver leurs intuitions linguistiques et leurs jugements de cohérence.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

5

Antalan, John Rafael Macalisang, und Francis Joseph Campena. „A Breadth-first Search Tree Construction for Multiplicative Circulant Graphs“. European Journal of Pure and Applied Mathematics 14, Nr. 1 (31.01.2021): 248–64. http://dx.doi.org/10.29020/nybg.ejpam.v14i1.3884.

Der volle Inhalt der Quelle

Annotation:

In this paper, we give a recursive method in constructing a breadth-first search tree for multiplicative circulant graphs of order power of odd. We then use the proposed construction in reproving some results concerning multiplicative circulant graph's diameter, average distance and distance spectral radius. We also determine the graph's Wiener index, vertex-forwarding index, and a bound for its edge-forwarding index. Finally, we discuss some possible research works in which the proposed construction can be applied.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

6

HALPERN, M. B., und N. A. OBERS. „NEW SUPERCONFORMAL CONSTRUCTIONS ON TRIANGLE-FREE GRAPHS“. International Journal of Modern Physics A 07, Nr. 29 (20.11.1992): 7263–86. http://dx.doi.org/10.1142/s0217751x92003331.

Der volle Inhalt der Quelle

Annotation:

It is known that the superconformal master equation has an ansatz which contains a graph theory of superconformal constructions. In this paper, we study a subansatz which is consistent and solvable on the set of triangle-free graphs. The resulting super-conformal level-families have rational central charge and the constructions are generically unitary. The level-families are generically new because irrational conformal weights occur in the generic construction, and the central charge of the generic level-family cannot be obtained by coset construction. The standard rational superconformal constructions in the subansatz are a subset of the constructions on edge-regular triangle-free graphs, and we call attention to the nonstandard constructions on these graphs as candidates for new rational superconformal field theories. We also find superconformal quadratic deformations at particular levels on almost all edge-regular triangle-free graphs.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

7

Akwu, A. D. „On Strongly Sum Difference Quotient Labeling of One-Point Union of Graphs, Chain and Corona Graphs“. Annals of the Alexandru Ioan Cuza University - Mathematics 61, Nr. 1 (01.01.2015): 101–8. http://dx.doi.org/10.2478/aicu-2014-0026.

Der volle Inhalt der Quelle

Annotation:

Abstract In this paper we study strongly sum difference quotient labeling of some graphs that result from three different constructions. The first construction produces one- point union of graphs. The second construction produces chain graph, i.e., a concatenation of graphs. A chain graph will be strongly sum difference quotient graph if any graph in the chain, accepts strongly sum difference quotient labeling. The third construction is the corona product; strongly sum difference quotient labeling of corona graph is obtained.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

8

Lorenzen, Kate. „Cospectral constructions for several graph matrices using cousin vertices“. Special Matrices 10, Nr. 1 (28.06.2021): 9–22. http://dx.doi.org/10.1515/spma-2020-0143.

Der volle Inhalt der Quelle

Annotation:

Abstract Graphs can be associated with a matrix according to some rule and we can find the spectrum of a graph with respect to that matrix. Two graphs are cospectral if they have the same spectrum. Constructions of cospectral graphs help us establish patterns about structural information not preserved by the spectrum. We generalize a construction for cospectral graphs previously given for the distance Laplacian matrix to a larger family of graphs. In addition, we show that with appropriate assumptions this generalized construction extends to the adjacency matrix, combinatorial Laplacian matrix, signless Laplacian matrix, normalized Laplacian matrix, and distance matrix. We conclude by enumerating the prevelance of this construction in small graphs for the adjacency matrix, combinatorial Laplacian matrix, and distance Laplacian matrix.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

9

Regonati, F., und N. Zagaglia Salvi. „Some constructions of $\lambda$-minimal graphs“. Czechoslovak Mathematical Journal 44, Nr. 2 (1994): 315–23. http://dx.doi.org/10.21136/cmj.1994.128459.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

10

Haythorpe, M., und A. Newcombe. „Constructing families of cospectral regular graphs“. Combinatorics, Probability and Computing 29, Nr. 5 (30.06.2020): 664–71. http://dx.doi.org/10.1017/s096354832000019x.

Der volle Inhalt der Quelle

Annotation:

AbstractA set of graphs are called cospectral if their adjacency matrices have the same characteristic polynomial. In this paper we introduce a simple method for constructing infinite families of cospectral regular graphs. The construction is valid for special cases of a property introduced by Schwenk. For the case of cubic (3-regular) graphs, computational results are given which show that the construction generates a large proportion of the cubic graphs, which are cospectral with another cubic graph.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

11

FARKAS, CATHERINE, ERICA FLAPAN und WYNN SULLIVAN. „UNRAVELLING TANGLED GRAPHS“. Journal of Knot Theory and Its Ramifications 21, Nr. 07 (07.04.2012): 1250074. http://dx.doi.org/10.1142/s0218216512500745.

Der volle Inhalt der Quelle

Annotation:

Motivated by proposed entangled molecular structures known as ravels, we introduce a method for constructing such entanglements from 2-string tangles. We then show that for most (but not all) arborescent tangles this construction yields either a planar θ4 graph or contains a knot.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

12

Crnković, Dean, Francesco Pavese und Andrea Švob. „Intriguing sets of strongly regular graphs and their related structures“. Contributions to Discrete Mathematics 18, Nr. 1 (30.04.2023): 66–89. http://dx.doi.org/10.55016/ojs/cdm.v18i1.73590.

Der volle Inhalt der Quelle

Annotation:

In this paper we outline a technique for constructing directed strongly regular graphs by using strongly regular graphs having a "nice" family of intriguing sets. Further, we investigate such a construction method for rank three strongly regular graphs having at most $45$ vertices. Finally, several examples of intriguing sets of polar spaces are provided.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

13

Grolmusz, Vince. „A Note on Explicit Ramsey Graphs and Modular Sieves“. Combinatorics, Probability and Computing 12, Nr. 5-6 (November 2003): 565–69. http://dx.doi.org/10.1017/s0963548303005698.

Der volle Inhalt der Quelle

Annotation:

In a previous paper we found a relation between the ranks of co-diagonal matrices (matrices with zeroes in their diagonal and nonzeroes elsewhere) and the quality of explicit Ramsey graph constructions. We also gave a construction based on the BBR polynomial of Barrington, Beigel and Rudich. In the present work we give another construction for low-rank co-diagonal matrices, based on a modular sieve formula.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

14

Cont, Rama, und Emily Tanimura. „Small-world graphs: characterization and alternative constructions“. Advances in Applied Probability 40, Nr. 4 (Dezember 2008): 939–65. http://dx.doi.org/10.1239/aap/1231340159.

Der volle Inhalt der Quelle

Annotation:

Small-world graphs are examples of random graphs which mimic empirically observed features of social networks. We propose an intrinsic definition of small-world graphs, based on a probabilistic formulation of scaling properties of the graph, which does not rely on any particular construction. Our definition is shown to encompass existing models of small-world graphs, proposed by Watts (1999) and studied by Barbour and Reinert (2001), which are based on random perturbations of a regular lattice. We also propose alternative constructions of small-world graphs which are not based on lattices and study their scaling properties.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

15

Cont, Rama, und Emily Tanimura. „Small-world graphs: characterization and alternative constructions“. Advances in Applied Probability 40, Nr. 04 (Dezember 2008): 939–65. http://dx.doi.org/10.1017/s0001867800002913.

Der volle Inhalt der Quelle

Annotation:

Small-world graphs are examples of random graphs which mimic empirically observed features of social networks. We propose an intrinsic definition of small-world graphs, based on a probabilistic formulation of scaling properties of the graph, which does not rely on any particular construction. Our definition is shown to encompass existing models of small-world graphs, proposed by Watts (1999) and studied by Barbour and Reinert (2001), which are based on random perturbations of a regular lattice. We also propose alternative constructions of small-world graphs which are not based on lattices and study their scaling properties.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

16

Abboud, Amir, Keren Censor-Hillel, Seri Khoury und Ami Paz. „Smaller Cuts, Higher Lower Bounds“. ACM Transactions on Algorithms 17, Nr. 4 (31.10.2021): 1–40. http://dx.doi.org/10.1145/3469834.

Der volle Inhalt der Quelle

Annotation:

This article proves strong lower bounds for distributed computing in the congest model, by presenting the bit-gadget : a new technique for constructing graphs with small cuts. The contribution of bit-gadgets is twofold. First, developing careful sparse graph constructions with small cuts extends known techniques to show a near-linear lower bound for computing the diameter, a result previously known only for dense graphs. Moreover, the sparseness of the construction plays a crucial role in applying it to approximations of various distance computation problems, drastically improving over what can be obtained when using dense graphs. Second, small cuts are essential for proving super-linear lower bounds, none of which were known prior to this work. In fact, they allow us to show near-quadratic lower bounds for several problems, such as exact minimum vertex cover or maximum independent set, as well as for coloring a graph with its chromatic number. Such strong lower bounds are not limited to NP-hard problems, as given by two simple graph problems in P, which are shown to require a quadratic and near-quadratic number of rounds. All of the above are optimal up to logarithmic factors. In addition, in this context, the complexity of the all-pairs-shortest-paths problem is discussed. Finally, it is shown that graph constructions for congest lower bounds translate to lower bounds for the semi-streaming model, despite being very different in its nature.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

17

Abboud, Amir, Keren Censor-Hillel, Seri Khoury und Ami Paz. „Smaller Cuts, Higher Lower Bounds“. ACM Transactions on Algorithms 17, Nr. 4 (31.10.2021): 1–40. http://dx.doi.org/10.1145/3469834.

Der volle Inhalt der Quelle

Annotation:

This article proves strong lower bounds for distributed computing in the congest model, by presenting the bit-gadget : a new technique for constructing graphs with small cuts. The contribution of bit-gadgets is twofold. First, developing careful sparse graph constructions with small cuts extends known techniques to show a near-linear lower bound for computing the diameter, a result previously known only for dense graphs. Moreover, the sparseness of the construction plays a crucial role in applying it to approximations of various distance computation problems, drastically improving over what can be obtained when using dense graphs. Second, small cuts are essential for proving super-linear lower bounds, none of which were known prior to this work. In fact, they allow us to show near-quadratic lower bounds for several problems, such as exact minimum vertex cover or maximum independent set, as well as for coloring a graph with its chromatic number. Such strong lower bounds are not limited to NP-hard problems, as given by two simple graph problems in P, which are shown to require a quadratic and near-quadratic number of rounds. All of the above are optimal up to logarithmic factors. In addition, in this context, the complexity of the all-pairs-shortest-paths problem is discussed. Finally, it is shown that graph constructions for congest lower bounds translate to lower bounds for the semi-streaming model, despite being very different in its nature.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

18

Redmon, Eric, Miles Mena, Megan Vesta, Alvi Renzyl Cortes, Lauren Gernes, Simon Merheb, Nick Soto, Chandler Stimpert und Amanda Harsy. „Optimal Tilings of Bipartite Graphs Using Self-Assembling DNA“. PUMP Journal of Undergraduate Research 6 (13.03.2023): 124–50. http://dx.doi.org/10.46787/pump.v6i0.2427.

Der volle Inhalt der Quelle

Annotation:

Motivated by the recent advancements in nanotechnology and the discovery of new laboratory techniques using the Watson-Crick complementary properties of DNA strands, formal graph theory has recently become useful in the study of self-assembling DNA complexes. Construction methods based on graph theory have resulted in significantly increased efficiency. We present the results of applying graph theoretical and linear algebra techniques for constructing crossed-prism graphs, crown graphs, book graphs, stacked book graphs, and helm graphs, along with kite, cricket, and moth graphs. In particular, we explore various design strategies for these graph families in two sets of laboratory constraints.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

19

Kırcalı Gürsoy, Necla Kırcalı. „Graphs of Wajsberg Algebras via Complement Annihilating“. Symmetry 15, Nr. 1 (01.01.2023): 121. http://dx.doi.org/10.3390/sym15010121.

Der volle Inhalt der Quelle

Annotation:

In this paper, W-graph, called the notion of graphs on Wajsberg algebras, is introduced such that the vertices of the graph are the elements of Wajsberg algebra and the edges are the association of two vertices. In addition to this, commutative W-graphs are also symmetric graphs. Moreover, a graph of equivalence classes of Wajsberg algebra is constructed. Meanwhile, new definitions as complement annihilator and ▵-connection operator on Wajsberg algebras are presented. Lemmas and theorems on these notions are proved, and some associated results depending on the graph’s algebraic properties are presented, and supporting examples are given. Furthermore, the algorithms for determining and constructing all these new notions in each section are generated.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

20

Tunçel Gölpek, Hande, und Aysun Aytaç. „Computing closeness for some graphs“. Acta Universitatis Sapientiae, Informatica 15, Nr. 2 (01.12.2023): 221–38. http://dx.doi.org/10.2478/ausi-2023-0015.

Der volle Inhalt der Quelle

Annotation:

Abstract The analysis of networks involves several crucial parameters. In this paper, we consider the closeness parameter, which is based on the total distance between every pair of vertices. Initially, we delve into a discussion about the applicability of the closeness parameter to Mycielski graphs. Our findings are categorized based on the underlying graph’s diameter. The formula for calculating the closeness of a Mycielski graph is derived for graphs with a diameter of less than or equal to 4. Furthermore, we establish a sharp lower bound for the closeness of a Mycielski graph when the diameter of the underlying graph is greater than 4. To achieve this, the closeness of the Mycielski transformation of a path graph plays an important role. Additionally, leveraging the obtained results, we examine the closeness of a special planar construction composed of path and cycle graphs, as well as its Mycielski transformation.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

21

Varghese, Seema. „Exploring the Fascinating World of Kneser Graphs: Characteristics, Construction, and Applications“. International Journal of Science and Research (IJSR) 12, Nr. 10 (05.10.2023): 615–18. http://dx.doi.org/10.21275/sr231008185629.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

22

Asghar, Hassan Jameel, Yvo Desmedt, Josef Pieprzyk und Ron Steinfeld. „A subexponential construction of graph coloring for multiparty computation“. Journal of Mathematical Cryptology 8, Nr. 4 (01.12.2014): 363–403. http://dx.doi.org/10.1515/jmc-2013-0035.

Der volle Inhalt der Quelle

Annotation:

Abstract We show the first deterministic construction of an unconditionally secure multiparty computation (MPC) protocol in the passive adversarial model over black-box non-Abelian groups which is both optimal (secure against an adversary who possesses any $t < \frac{n}{2}$ inputs) and has subexponential complexity of construction based on coloring of planar graphs. More specifically, following the result of Desmedt et al. (2012) that the problem of MPC over non-Abelian groups can be reduced to finding a t-reliable n-coloring of planar graphs, we show the construction of such a graph which allows a path from the input nodes to the output nodes when any t-party subset is in the possession of the adversary. Unlike the deterministic constructions from Desmedt et al. (2012) our construction has subexponential complexity and is optimal at the same time, i.e., it is secure for any $t < \frac{n}{2}$ .

APA, Harvard, Vancouver, ISO und andere Zitierweisen

23

Xu, Zhao Di, Xiao Yi Li und Wan Xi Chou. „Methods of Constructing and Enumerating the Spanning Tree of a Connected Graph“. Applied Mechanics and Materials 496-500 (Januar 2014): 2363–66. http://dx.doi.org/10.4028/www.scientific.net/amm.496-500.2363.

Der volle Inhalt der Quelle

Annotation:

A definition concerning the spanning sub graph and spanning sub graph circle is given. Use the enumerating methods of spanning sub circle; seek out the spanning sub graph of spanning trees. The theorems of constructing and enumerating the spanning trees are proved. The methods of enumerating and constructing connected graph spanning tree are proposed. The application examples of construction theorem and enumerating theorem are given. the spanning sub graphs number of five plane graph and the construction of Constituent sub-graph are introduced, thus verifying constructing and enumerating theorem are useful and effective. This method Is a Simple and easy method to construct the spanning tree of connected graph.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

24

Gorda, Elena, Svitlana Tsiutsiura und Tamara Liashchenko. „COLOROMETRIC ANALYSIS OF THE IMAGE OF THE BUILDING SITE“. Management of Development of Complex Systems, Nr. 49 (11.04.2022): 66–73. http://dx.doi.org/10.32347/2412-9933.2022.49.66-73.

Der volle Inhalt der Quelle

Annotation:

The paper considers the approach to the formalization of the colorimetric (color) atlas of the construction site (СABS), which is determined by the subject area at the intersection of disciplines: materials science, structural mechanics and machine mechanics, technical condition control, photogrammetry, pattern recognition theory. Each of the above applied areas contains its own knowledge base, various information technologies that take into account the characteristics of each of them. The procedure of forming the concept of color atlas of the construction site in the intellectual information environment in construction, its features and composition, the difference from the usual procedures of forming the knowledge system, as well as the proposed and described approach to its study, the information interaction of the intellectual environment of the object object of construction. The possibility of constructing different formalizations of СABS on the basis of ontological and semantic graphs and the graph of the construction site image is shown. The problems that arise in the process of formalization and analysis of СABS in order to search for image elements are identified and described. The substantive structure of СABS and the equivalence of СABS graphs are determined, taking into account the possibility of introducing similarity measures. СABS in terms of pragmatic classification is a specialized finding of elements on construction sites. The work is performed in the framework of cluster analysis and focuses on the development of methods for constructing algorithms for recognition and identification of construction sites. For the described transformations, research was conducted on their observation in digital images, as well as the possibility of observing the invariants of transformations. The work was performed for СABS in order to determine the possibility of building its information model, taking into account the development of methods for constructing algorithms for recognition and identification on construction sites. The possibility of constructing СABS on the basis of a set of images is investigated, the possibility of corresponding visualizations of СABS СABS as a means of categorization is established.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

25

Goldblatt, Robert, Ian Hodkinson und Yde Venema. „Erdős Graphs Resolve Fine's Canonicity Problem“. Bulletin of Symbolic Logic 10, Nr. 2 (Juni 2004): 186–208. http://dx.doi.org/10.2178/bsl/1082986262.

Der volle Inhalt der Quelle

Annotation:

AbstractWe show that there exist 2ℵ0 equational classes of Boolean algebras with operators that are not generated by the complex algebras of any first-order definable class of relational structures. Using a variant of this construction, we resolve a long-standing question of Fine, by exhibiting a bimodal logic that is valid in its canonical frames, but is not sound and complete for any first-order definable class of Kripke frames (a monomodal example can then be obtained using simulation results of Thomason). The constructions use the result of Erdos that there are finite graphs with arbitrarily large chromatic number and girth.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

26

Princess Rathinabai, G., und G. Jeyakumar. „CONSTRUCTION OF COLOR GRAPHS“. Advances in Mathematics: Scientific Journal 9, Nr. 5 (04.07.2020): 2397–406. http://dx.doi.org/10.37418/amsj.9.5.3.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

27

Ligong, Wang, Li Xueliang und Zhang Shenggui. „Construction of integral graphs“. Applied Mathematics-A Journal of Chinese Universities 15, Nr. 3 (September 2000): 239–46. http://dx.doi.org/10.1007/s11766-000-0046-z.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

28

Dutta, Supriyo, und Bibhas Adhikari. „Construction of cospectral graphs“. Journal of Algebraic Combinatorics 52, Nr. 2 (24.09.2019): 215–35. http://dx.doi.org/10.1007/s10801-019-00900-y.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

29

Martins, Maria Maria Pereira, Carolina Fernandes de Carvalho und Carlos Eduardo Ferreira Monteiro. „The analysis of statistical graphs constructed by primary school teachers“. Acta Scientiae 23, Nr. 6 (18.11.2021): 28–57. http://dx.doi.org/10.17648/acta.scientiae.6762.

Der volle Inhalt der Quelle

Annotation:

Background: Statistical graphs are widely used in society and are important in presenting data related to different topics. Statistics education aims improve the teaching and learning of statistics, which include the approaches to statistics graphs. Objectives: This article analyses the construction of statistical graphs by in-service teachers and their reasons for choosing these graphs. Design: It was conducted an empirical study from a qualitative perspective which investigated teachers’ choices and constructions of statistical graphs. Setting and Participants: The participants were 22 primary school teachers from public schools located in Recife Metropolitan Area, Brazil. They expressed their intention to be interviewed when they responded to a questionnaire applied among a larger number of teachers. Data collection and analysis: The interviews were composed of two tasks comprised of statistical data in which participants had to choose a type of graph, justify the choice, and construct a graph of a chosen type. It was carried out a content analysis of speech protocols. Results: The reasons for participants’ choices seemed to be related to their familiarity with the type of graph, and they constructed graphs with high levels of complexity. Conclusions: The results of this study emphasised the importance of primary school teachers developing specific knowledge about graphs through pre-service and in-service elementary school teacher education. The results from this research study offer new questions concerning the construction and the choice for statistical graphs, which include the influence of new technologies and the use of textbooks.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

30

c, Dean Crnkovi, Ana Grbac und Andrea v. Svob. „Block designs from self-dual codes obtained from Paley designs and Paley graphs“. Glasnik Matematicki 58, Nr. 2 (27.12.2023): 167–79. http://dx.doi.org/10.3336/gm.58.2.02.

Der volle Inhalt der Quelle

Annotation:

In 2002, P. Gaborit introduced two constructions of self-dual codes using quadratic residues, so-called pure and bordered construction, as a generalization of the Pless symmetry codes. In this paper, we further study conditions under which the pure and the bordered construction using Paley designs and Paley graphs yield self-dual codes. Special attention is given to the binary and ternary codes. Further, we construct \(t\)-designs from supports of the codewords of a particular weight in the binary and ternary codes obtained.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

31

Gamorez, Anabel Enriquez, und Sergio R. Canoy Jr. „On a Topological Space Generated by Monophonic Eccentric Neighborhoods of a Graph“. European Journal of Pure and Applied Mathematics 14, Nr. 3 (05.08.2021): 695–705. http://dx.doi.org/10.29020/nybg.ejpam.v14i3.3990.

Der volle Inhalt der Quelle

Annotation:

In this paper, we present a way of constructing a topology on a vertex set of a graph using monophonic eccentric neighborhoods of the graph G.Â In this type of construction, we characterize those graphs that induced the indiscrete topology, the discrete topology, and a particular point topology.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

32

VAIDYA, SAMIR K., und KALPESH M. POPAT. „Construction of L-Borderenergetic Graphs“. Kragujevac Journal of Mathematics 45, Nr. 6 (Dezember 2021): 873–80. http://dx.doi.org/10.46793/kgjmat2106.873v.

Der volle Inhalt der Quelle

Annotation:

If a graph G of order n has the Laplacian energy same as that of complete graph Kn then G is said to be L-borderenergeic graph. It is interesting and challenging as well to identify the graphs which are L-borderenergetic as only few graphs are known to be L-borderenergetic. In the present work we have investigated a sequence of L-borderenergetic graphs and also devise a procedure to ﬁnd sequence of L-borderenergetic graphs from the known L-borderenergetic graph.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

33

BERMOND, JEAN-CLAUDE, PAVOL HELL und JEAN-JACQUES QUISQUATER. „CONSTRUCTION OF LARGE PACKET RADIO NETWORKS“. Parallel Processing Letters 02, Nr. 01 (März 1992): 3–12. http://dx.doi.org/10.1142/s012962649200012x.

Der volle Inhalt der Quelle

Annotation:

We outline constructions of packet radio networks (with time division multiplexing) that achieve much better parameters than those previously proposed. Given the desired diameter and number of slots per time frame, our networks seek to maximize the possible number of users. We model this as a problem of constructing large graphs or digraphs with given diameter and chromatic index, and relate it to extant work on large graphs with given diameter and maximum degree.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

34

LEWIS, ROBERT R. „Improved Upper Bounds for the Order of Some Classes of Abelian Cayley and Circulant Graphs of Diameter Two“. Journal of Interconnection Networks 17, Nr. 03n04 (September 2017): 1741012. http://dx.doi.org/10.1142/s0219265917410122.

Der volle Inhalt der Quelle

Annotation:

In the degree-diameter problem for Abelian Cayley and circulant graphs of diameter 2 and arbitrary degree d there is a wide gap between the best lower and upper bounds valid for all d, being quadratic functions with leading coefficient 1/4 and 1/2 respectively. Recent papers have presented constructions which increase the coefficient of the lower bound to be at or just below 3/8 for sparse sets of degree d related to primes of specific congruence classes. The constructions use the direct product of the multiplicative and additive subgroups of a Galois field and a specific cyclic group of coprime order. It was anticipated that this approach would be capable of yielding further improvement towards the upper bound value of 1/2. In this paper, however, it is proved that the quadratic coefficient of the order of families of Abelian Cayley graphs of this class of construction can never exceed the value of 3/8, establishing an asymptotic limit of 3/8 for the quadratic coefficient of families of extremal graphs of this class. By applying recent results from number theory these constructions can be extended to be valid for every degree above some threshold, establishing an improved asymptotic lower bound approaching 3/8 for general Abelian Cayley and circulant graphs of diameter 2 and arbitrary degree d.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

35

McGuirk, Zachary, und Byungdo Park. „A Model of Directed Graph Cofiber“. Axioms 11, Nr. 1 (16.01.2022): 32. http://dx.doi.org/10.3390/axioms11010032.

Der volle Inhalt der Quelle

Annotation:

In the homotopy theory of spaces, the image of a continuous map is contractible to a point in its cofiber. This property does not apply when we discretize spaces and continuous maps to directed graphs and their morphisms. In this paper, we give a construction of a cofiber of a directed graph map whose image is contractible in the cofiber. Our work reveals that a category-theoretically correct construction in continuous setup is no longer correct when it is discretized and hence leads to look at canonical constructions in category theory in a different perspective.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

36

SUN, HE, und HONG ZHU. „ON CONSTRUCTION OF ALMOST-RAMANUJAN GRAPHS“. Discrete Mathematics, Algorithms and Applications 01, Nr. 02 (Juni 2009): 193–203. http://dx.doi.org/10.1142/s1793830909000154.

Der volle Inhalt der Quelle

Annotation:

O. Reingold et al. introduced the notion zig-zag product on two different graphs, and presented a fully explicit construction of d-regular expanders with the second largest eigenvalue O(d-1/3). In the same paper, they ask whether or not the similar technique can be used to construct expanders with the second largest eigenvalue O(d-1/2). Such graphs are called Ramanujan graphs. Recently, zig-zag product has been generalized by A. Ben-Aroya and A. Ta-Shma. Using this technique, they present a family of expanders with the second largest eigenvalue d-1/2 + o(1), what they call almost-Ramanujan graphs. However, their construction relies on local invertible functions and the dependence between the big graph and several small graphs, which makes the construction more complicated. In this paper, we shall give a generalized theorem of zig-zag product. Specifically, the zig-zag product of one "big" graph and several "small" graphs with the same size will be formalized. By choosing the big graph and several small graphs individually, we shall present a family of fully explicitly almost-Ramanujan graphs with locally invertible function waived.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

37

GOTO, SATOSHI. „ORBIFOLD CONSTRUCTION FOR NON-AFD SUBFACTORS“. International Journal of Mathematics 05, Nr. 05 (Oktober 1994): 725–46. http://dx.doi.org/10.1142/s0129167x9400036x.

Der volle Inhalt der Quelle

Annotation:

We extend the orbifold construction to arbitrary (not necessarily AFD) subfactors. That is, we construct subfactors with principal graphs D2n from those with principal graphs A4n−3 by taking simultaneous Z2-crossed products with non-strongly outer actions. Our result can be applied to Popa's universal subfactors with principal graphs A4n−3, for example.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

38

Boba, Antonio. „On Constructing Graphs“. Critical Care Medicine 25, Nr. 9 (September 1997): 1612. http://dx.doi.org/10.1097/00003246-199709000-00034.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

39

Dress, A. W. M., und D. H. Huson. „Constructing splits graphs“. IEEE/ACM Transactions on Computational Biology and Bioinformatics 1, Nr. 3 (Juli 2004): 109–15. http://dx.doi.org/10.1109/tcbb.2004.27.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

40

Mahmood, H., I. Anwar und M. K. Zafar. „A construction of Cohen–Macaulay f-graphs“. Journal of Algebra and Its Applications 13, Nr. 06 (20.04.2014): 1450012. http://dx.doi.org/10.1142/s0219498814500121.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

41

Tsitsiashvili, Gurami. „Construction and Analysis of Queuing and Reliability Models Using Random Graphs“. Mathematics 9, Nr. 19 (07.10.2021): 2511. http://dx.doi.org/10.3390/math9192511.

Der volle Inhalt der Quelle

Annotation:

In this paper, the use of the construction of random processes on graphs allows us to expand the models of the theory of queuing and reliability by constructing. These problems are important because the emphasis on the legal component largely determines functioning of these models. The considered models are reliability and queuing. Reliability models arranged according to the modular principle and reliability networks in the form of planar graphs. The queuing models considered here are queuing networks with multi server nodes and failures, changing the parameters of the queuing system in a random environment with absorbing states, and the process of growth of a random network. This is determined by the possibility of using, as traditional probability methods, mathematical logic theorems, geometric images of a queuing network, dual graphs to planar graphs, and a solution to the Dirichlet problem.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

42

Servatius, Brigitte, und Peter R. Christopher. „Construction of Self-Dual Graphs“. American Mathematical Monthly 99, Nr. 2 (Februar 1992): 153. http://dx.doi.org/10.2307/2324184.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

43

Aurenhammer, Franz, Christoph Ladurner und Michael Steinkogler. „Incremental Construction of Motorcycle Graphs“. Algorithms 15, Nr. 7 (27.06.2022): 225. http://dx.doi.org/10.3390/a15070225.

Der volle Inhalt der Quelle

Annotation:

We show that the so-called motorcycle graph of a planar polygon can be constructed by a randomized incremental algorithm that is simple and experimentally fast. Various test data are given, and a clustering method for speeding up the construction is proposed.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

44

Jeyanthi, P., und D. Ramya. „On Construction of Mean Graphs“. Journal of Scientific Research 5, Nr. 2 (22.04.2013): 265–73. http://dx.doi.org/10.3329/jsr.v5i2.11545.

Der volle Inhalt der Quelle

Annotation:

A graph with p vertices and q edges is called a mean graph if there is an injective function f that maps V(G) to such that for each edge uv, is labeled with if is even and if is odd. Then the resulting edge labels are distinct. In this paper, we prove some general theorems on mean graphs and show that the graphs , Jewel graph , Jelly fish graph and are mean graphs.Keywords: Mean labeling; Mean graph.© 2013 JSR Publications. ISSN: 2070-0237 (Print); 2070-0245 (Online). All rights reserved.doi: http://dx.doi.org/10.3329/jsr.v5i2.11545 J. Sci. Res. 5 (2), 265-273 (2013)

APA, Harvard, Vancouver, ISO und andere Zitierweisen

45

Acharya, Mukti, und T. Singh. „Construction of Graceful Signed Graphs“. Defence Science Journal 56, Nr. 5 (01.11.2006): 801–8. http://dx.doi.org/10.14429/dsj.56.1948.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

46

Tsuchiya, Morimasa, Kenjiro Ogawa und Shin-ichi Iwaia. „On construction of bound graphs“. Electronic Notes in Discrete Mathematics 5 (Juli 2000): 299–302. http://dx.doi.org/10.1016/s1571-0653(05)80191-x.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

47

Kochol, Martin. „Construction of crossing-critical graphs“. Discrete Mathematics 66, Nr. 3 (September 1987): 311–13. http://dx.doi.org/10.1016/0012-365x(87)90108-7.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

48

Nair, P. S. „Construction of self-complementary graphs“. Discrete Mathematics 175, Nr. 1-3 (Oktober 1997): 283–87. http://dx.doi.org/10.1016/s0012-365x(96)00127-6.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

49

Ishihara, T. „Cameron's construction of two-graphs“. Discrete Mathematics 215, Nr. 1-3 (März 2000): 283–91. http://dx.doi.org/10.1016/s0012-365x(99)00320-9.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

50

Servatius, Brigitte, und Peter R. Christopher. „Construction of Self-Dual Graphs“. American Mathematical Monthly 99, Nr. 2 (Februar 1992): 153–58. http://dx.doi.org/10.1080/00029890.1992.11995825.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wir bieten Rabatte auf alle Premium-Pläne für Autoren, deren Werke in thematische Literatursammlungen aufgenommen wurden. Kontaktieren Sie uns, um einen einzigartigen Promo-Code zu erhalten!