Bibliografías temáticas / Graphs Construction

Índice

  1. Artículos de revistas

Literatura académica sobre el tema "Graphs Construction"

Autor: Grafiati
Publicado: 25 de mayo de 2024

Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros

Elija tipo de fuente:

Consulte las listas temáticas de artículos, libros, tesis, actas de conferencias y otras fuentes académicas sobre el tema "Graphs Construction".

Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.

También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.

Artículos de revistas sobre el tema "Graphs Construction"

1

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

Texto completo
Resumen
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.
Los estilos APA, Harvard, Vancouver, ISO, etc.
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, no. 1 (2015): 101–8. http://dx.doi.org/10.2478/aicu-2014-0026.

Texto completo
Resumen
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.
Los estilos APA, Harvard, Vancouver, ISO, etc.
3

Zhang, Xiaoling, and 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.

Texto completo
Resumen
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.
Los estilos APA, Harvard, Vancouver, ISO, etc.
4

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

Texto completo
Resumen
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.
Los estilos APA, Harvard, Vancouver, ISO, etc.
5

FARKAS, CATHERINE, ERICA FLAPAN, and WYNN SULLIVAN. "UNRAVELLING TANGLED GRAPHS." Journal of Knot Theory and Its Ramifications 21, no. 07 (2012): 1250074. http://dx.doi.org/10.1142/s0218216512500745.

Texto completo
Resumen
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.
Los estilos APA, Harvard, Vancouver, ISO, etc.
6

Princess Rathinabai, G., and G. Jeyakumar. "CONSTRUCTION OF COLOR GRAPHS." Advances in Mathematics: Scientific Journal 9, no. 5 (2020): 2397–406. http://dx.doi.org/10.37418/amsj.9.5.3.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
7

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

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
8

Dutta, Supriyo, and Bibhas Adhikari. "Construction of cospectral graphs." Journal of Algebraic Combinatorics 52, no. 2 (2019): 215–35. http://dx.doi.org/10.1007/s10801-019-00900-y.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
9

Haythorpe, M., and A. Newcombe. "Constructing families of cospectral regular graphs." Combinatorics, Probability and Computing 29, no. 5 (2020): 664–71. http://dx.doi.org/10.1017/s096354832000019x.

Texto completo
Resumen
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.
Los estilos APA, Harvard, Vancouver, ISO, etc.
10

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

Texto completo
Resumen
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.
Los estilos APA, Harvard, Vancouver, ISO, etc.
Más fuentes
También puede estar interesado en las bibliografías ampliadas sobre el tema "Graphs Construction" para tipos de fuentes particulares:
Artículos de revistas
Ofrecemos descuentos en todos los planes premium para autores cuyas obras están incluidas en selecciones literarias temáticas. ¡Contáctenos para obtener un código promocional único!

Pasar a la bibliografía