Einloggen

Thematische Bibliographien / Graphs Construction / Zeitschriftenartikel

Zeitschriftenartikel zum Thema „Graphs Construction“

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

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 "Graphs Construction" 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

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

2

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

3

Zhang, Xiaoling, und Chengyuan Song. „The Distance Matrices of Some Graphs Related to Wheel Graphs“. Journal of Applied Mathematics 2013 (2013): 1–5. http://dx.doi.org/10.1155/2013/707954.

Der volle Inhalt der Quelle

Annotation:

LetDdenote the distance matrix of a connected graphG. The inertia ofDis the triple of integers (n+(D), n0(D), n-(D)), wheren+(D),n0(D), andn-(D)denote the number of positive, 0, and negative eigenvalues ofD, respectively. In this paper, we mainly study the inertia of distance matrices of some graphs related to wheel graphs and give a construction for graphs whose distance matrices have exactly one positive eigenvalue.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

4

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

5

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

6

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

7

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

8

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

9

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

10

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

11

Hwang, Yuan-Shin. „Parallelizing graph construction operations in programs with cyclic graphs“. Parallel Computing 28, Nr. 9 (September 2002): 1307–28. http://dx.doi.org/10.1016/s0167-8191(02)00114-x.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

12

Vaidya, S. K., und Kalpesh M. Popat. „Construction of L-equienergetic graphs using some graph operations“. AKCE International Journal of Graphs and Combinatorics 17, Nr. 3 (22.04.2020): 877–82. http://dx.doi.org/10.1016/j.akcej.2019.06.012.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

13

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

14

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

15

Allen, Stephen, David Pask und Aidan Sims. „A dual graph construction for higher-rank graphs, and $K$-theory for finite 2-graphs“. Proceedings of the American Mathematical Society 134, Nr. 02 (29.06.2005): 455–64. http://dx.doi.org/10.1090/s0002-9939-05-07994-3.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

16

Zhang, Fuji, und Heping Zhang. „Construction for bicritical graphs and k-extendable bipartite graphs“. Discrete Mathematics 306, Nr. 13 (Juli 2006): 1415–23. http://dx.doi.org/10.1016/j.disc.2005.12.025.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

17

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

18

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

19

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

20

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

21

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

22

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

23

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

24

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

25

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

26

König, Barbara, und Vitali Kozioura. „Incremental construction of coverability graphs“. Information Processing Letters 103, Nr. 5 (August 2007): 203–9. http://dx.doi.org/10.1016/j.ipl.2007.04.002.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

27

Averbuch, A., R. Hollander Shabtai und Y. Roditty. „Efficient construction of broadcast graphs“. Discrete Applied Mathematics 171 (Juli 2014): 9–14. http://dx.doi.org/10.1016/j.dam.2014.01.025.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

28

Janson, Svante, und Joel Spencer. „Probabilistic construction of proportional graphs“. Random Structures & Algorithms 3, Nr. 2 (1992): 127–37. http://dx.doi.org/10.1002/rsa.3240030203.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

29

Zhu, Xuding. „Construction of uniquelyH-colorable graphs“. Journal of Graph Theory 30, Nr. 1 (Januar 1999): 1–6. http://dx.doi.org/10.1002/(sici)1097-0118(199901)30:1<1::aid-jgt1>3.0.co;2-p.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

30

Wieten, Remi, Floris Bex, Henry Prakken und Silja Renooij. „Information graphs and their use for Bayesian network graph construction“. International Journal of Approximate Reasoning 136 (September 2021): 249–80. http://dx.doi.org/10.1016/j.ijar.2021.06.007.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

31

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

32

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

33

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

34

Mikheenko, Alla, und Mikhail Kolmogorov. „Assembly Graph Browser: interactive visualization of assembly graphs“. Bioinformatics 35, Nr. 18 (04.02.2019): 3476–78. http://dx.doi.org/10.1093/bioinformatics/btz072.

Der volle Inhalt der Quelle

Annotation:

Abstract Summary Currently, most genome assembly projects focus on contigs and scaffolds rather than assembly graphs that provide a more comprehensive representation of an assembly. Since interactive visualization of large assembly graphs remains an open problem, we developed an Assembly Graph Browser (AGB) tool that visualizes large assembly graphs, extending the functionality of previously developed visualization approaches. Assembly Graph Browser includes a number of novel functions including repeat analysis, construction of the contracted assembly graphs (i.e. the graphs obtained by collapsing a selected set of edges) and a new approach to visualizing large assembly graphs. Availability and implementation http://www.github.com/almiheenko/AGB. Supplementary information Supplementary data are available at Bioinformatics online.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

35

Lou, Zhenzhen, Qiongxiang Huang und Xueyi Huang. „On the construction of Q-controllable graphs“. Electronic Journal of Linear Algebra 32 (06.02.2017): 365–79. http://dx.doi.org/10.13001/1081-3810.3298.

Der volle Inhalt der Quelle

Annotation:

A connected graph is called Q-controllable if its signless Laplacian eigenvalues are mutually distinct and main. Two graphs G and H are said to be Q-cospectral if they share the same signless Laplacian spectrum. In this paper, infinite families of Q-controllable graphs are constructed, by using the operator of rooted product introduced by Godsil and McKay. In the process, innitely many non-isomorphic Q-cospectral graphs are also constructed, especially, including those graphs whose signless Laplacian eigenvalues are mutually distinct.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

36

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

37

GLAVAŠ, GORAN, und JAN ŠNAJDER. „Construction and evaluation of event graphs“. Natural Language Engineering 21, Nr. 4 (01.05.2014): 607–52. http://dx.doi.org/10.1017/s1351324914000060.

Der volle Inhalt der Quelle

Annotation:

AbstractEvents play an important role in natural language processing and information retrieval due to numerous event-oriented texts and information needs. Many natural language processing and information retrieval applications could benefit from a structured event-oriented document representation. In this paper, we proposeevent graphsas a novel way of structuring event-based information from text. Nodes in event graphs represent the individual mentions of events, whereas edges represent the temporal and coreference relations between mentions. Contrary to previous natural language processing research, which has mainly focused on individual event extraction tasks, we describe a complete end-to-end system for event graph extraction from text. Our system is a three-stage pipeline that performs anchor extraction, argument extraction, and relation extraction (temporal relation extraction and event coreference resolution), each at a performance level comparable with the state of the art. We presentEvExtra, a large newspaper corpus annotated with event mentions and event graphs, on which we train and evaluate our models. To measure the overall quality of the constructed event graphs, we propose two metrics based on the tensor product between automatically and manually constructed graphs. Finally, we evaluate the overall quality of event graphs with the proposed evaluation metrics and perform a headroom analysis of the system.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

38

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

39

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

40

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

41

LI, CAI HENG, und CHERYL E. PRAEGER. „SELF-COMPLEMENTARY VERTEX-TRANSITIVE GRAPHS NEED NOT BE CAYLEY GRAPHS“. Bulletin of the London Mathematical Society 33, Nr. 6 (November 2001): 653–61. http://dx.doi.org/10.1112/s0024609301008505.

Der volle Inhalt der Quelle

Annotation:

A construction is given of an infinite family of finite self-complementary, vertex-transitive graphs which are not Cayley graphs. To the authors' knowledge, these are the first known examples of such graphs. The nature of the construction was suggested by a general study of the structure of self-complementary, vertex-transitive graphs. It involves the product action of a wreath product of permutation groups.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

42

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

43

Deng, Bo, Caibing Chang, Haixing Zhao und Kinkar Chandra Das. „Construction for the Sequences of Q-Borderenergetic Graphs“. Mathematical Problems in Engineering 2020 (18.07.2020): 1–5. http://dx.doi.org/10.1155/2020/6176849.

Der volle Inhalt der Quelle

Annotation:

This research intends to construct a signless Laplacian spectrum of the complement of any k-regular graph G with order n. Through application of the join of two arbitrary graphs, a new class of Q-borderenergetic graphs is determined with proof. As indicated in the research, with a regular Q-borderenergetic graph, sequences of regular Q-borderenergetic graphs can be constructed. The procedures for such a construction are determined and demonstrated. Significantly, all the possible regular Q-borderenergetic graphs of order 7<n≤10 are determined.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

44

Ahmad, Safyan, und Shamsa Kanwal. „A Construction of Cohen-Macaulay Graphs“. Studia Scientiarum Mathematicarum Hungarica 56, Nr. 4 (Dezember 2019): 492–99. http://dx.doi.org/10.1556/012.2019.56.4.1437.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

45

Bapat, Ravindra B., und Masoud Karimi. „Construction of cospectral integral regular graphs“. Discussiones Mathematicae Graph Theory 37, Nr. 3 (2017): 595. http://dx.doi.org/10.7151/dmgt.1960.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

46

Kejriwal, Mayank, Juan Sequeda und Vanessa Lopez. „Knowledge graphs: Construction, management and querying“. Semantic Web 10, Nr. 6 (28.10.2019): 961–62. http://dx.doi.org/10.3233/sw-190370.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

47

Gervacio, Severino V., Teofina A. Rapanut und Phoebe Chloe F. Ramos. „Characterization and Construction of Permutation Graphs“. Open Journal of Discrete Mathematics 03, Nr. 01 (2013): 33–38. http://dx.doi.org/10.4236/ojdm.2013.31007.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

48

Doraiswamy, H., und V. Natarajan. „Output-Sensitive Construction of Reeb Graphs“. IEEE Transactions on Visualization and Computer Graphics 18, Nr. 1 (Januar 2012): 146–59. http://dx.doi.org/10.1109/tvcg.2011.37.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

49

Adikusuma, Yohanes Yudhi, Zheng Fang und Ying He. „Fast Construction of Discrete Geodesic Graphs“. ACM Transactions on Graphics 39, Nr. 2 (14.04.2020): 1–14. http://dx.doi.org/10.1145/3144567.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

50

RANDIĆ, MILAN, und ALEXANDER F. KLEINER. „On the Construction of Endospectral Graphs“. Annals of the New York Academy of Sciences 555, Nr. 1 Combinatorial (Mai 1989): 320–31. http://dx.doi.org/10.1111/j.1749-6632.1989.tb22467.x.

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!