Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Ana Laura Trujillo-Negrete"'
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol vol. 24, no. 1, Iss Graph Theory (2022)
Let $k$ and $n$ be integers such that $1\leq k \leq n-1$, and let $G$ be a simple graph of order $n$. The $k$-token graph $F_k(G)$ of $G$ is the graph whose vertices are the $k$-subsets of $V(G)$, where two vertices are adjacent in $F_k(G)$ whenever
Externí odkaz:
https://doaj.org/article/5036cb03dd244ab6ba69d9cfefa80098
Publikováno v:
Symmetry, Vol 13, Iss 6, p 1076 (2021)
Let G be a simple graph of order n with vertex set V(G) and edge set E(G), and let k be an integer such that 1≤k≤n−1. The k-token graph G{k} of G is the graph whose vertices are the k-subsets of V(G), where two vertices A and B are adjacent in
Externí odkaz:
https://doaj.org/article/a051e792aa96425aacec68e52364d31f
Publikováno v:
Matemática Contemporânea. 48
Autor:
Miquel Àngel Fiol, F. J. Zaragoza Martínez, Frank Duque, Clemens Huemer, Ruy Fabila-Monroy, Cristina Dalfó, Ana Laura Trujillo-Negrete
Publikováno v:
Linear algebra and its applications
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Repositorio Abierto de la UdL
Universitad de Lleida
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Repositorio Abierto de la UdL
Universitad de Lleida
We study the Laplacian spectrum of token graphs, also called symmetric powers of graphs. The k-token graph Fk(G) of a graph G is the graph whose vertices are the k-subsets of vertices from G, two of which being adjacent whenever their symmetric diffe
Autor:
Francisco Javier Zaragoza Martínez, Frank Duque, Clemens Huemer, Cristina Dalfó, Ruy Fabila-Monroy, Ana Laura Trujillo-Negrete, Miquel Àngel Fiol
Publikováno v:
Extended Abstracts EuroComb 2021. European Conference on Combinatorics, Graph Theory and Applications. Trends in Mathematics book series (RPCRMB,volume 14)
Trends in Mathematics
Trends in Mathematics-Extended Abstracts EuroComb 2021
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Trends in Mathematics ISBN: 9783030838225
Trends in Mathematics
Trends in Mathematics-Extended Abstracts EuroComb 2021
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Trends in Mathematics ISBN: 9783030838225
This version of the contribution has been accepted for publication, after peer review but is not the Version of Record and does not reflect post-acceptance improvements, or any corrections. The Version of Record is available online at: http://dx.doi.
Publikováno v:
Graphs and Combinatorics. 34:777-790
Let G be a simple graph of order n and let $$k\in \{1,\ldots ,n-1\}$$ . The k-token graph $$F_k(G)$$ of G is the graph whose vertices are the k-subsets of V(G), where two vertices are adjacent in $$F_k(G)$$ whenever their symmetric difference is an e
Publikováno v:
The Art of Discrete and Applied Mathematics. 1:#1.07
In this note we show that the token graphs of fan graphs are Hamiltonian. This result provides another proof of the Hamiltonicity of Johnson graphs and also extends previous results obtained by Mirajkar and Priyanka Y. B.
Comment: V2 is a revise
Comment: V2 is a revise
Publikováno v:
Computational Geometry
Let S be a set of n points in general position in the plane. Suppose that each point of S has been assigned one of k ≥ 3 possible colors and that there is the same number, m, of points of each color class. This means n = k m . A polygon with vertic