English
Related papers

Related papers: Repr\'esentations lin\'eaires des graphes finis

200 papers

A signed graph is a pair $(G,\Sigma)$, where $G=(V,E)$ is a graph (in which parallel edges and loops are permitted) with $V=\{1,\ldots,n\}$ and $\Sigma\subseteq E$. The edges in $\Sigma$ are called odd edges and the other edges of $E$ even.…

Combinatorics · Mathematics 2014-02-19 Marina Arav , Hein van der Holst , John Sinkovic

A subgraph $H$ of a graph $G$ is isometric if the distances between vertices in $H$ coincide with the distances between the corresponding vertices in $G$. We show that for any integer $n\ge 1$, there is a graph on $3^{n+O(\log^2 n)}$…

Combinatorics · Mathematics 2021-06-24 Louis Esperet , Cyril Gavoille , Carla Groenland

We prove some finiteness results for discrete isometry groups $\Gamma$ of uniformly packed CAT$(0)$-spaces $X$ with uniformly bounded codiameter (up to group isomorphism), and for CAT$(0)$-orbispaces $M = \Gamma \backslash X$ (up to…

Group Theory · Mathematics 2024-05-01 Nicola Cavallucci , Andrea Sambusetti

The universal adjacency matrix $U$ of a graph $\Gamma$, with adjacency matrix $A$, is a linear combination of $A$, the diagonal matrix $D$ of vertex degrees, the identity matrix $I$, and the all-1 matrix $J$ with real coefficients, that is,…

Combinatorics · Mathematics 2019-12-11 C. Dalfó , M. A. Fiol , S. Pavlíková , J. Širáň

A graph $\Gamma$ is said to be distance-balanced if for any edge $uv$ of $\Gamma$, the number of vertices closer to $u$ than to $v$ is equal to the number of vertices closer to $v$ than to $u$, and it is called nicely distance-balanced if…

Combinatorics · Mathematics 2022-07-08 Blas Fernandez , Ademir Hujdurovic

The main result of this paper is that, if $\Gamma$ is a connected 4-valent $G$-arc-transitive graph and $v$ is a vertex of $\Gamma$, then either $\Gamma$ is one of a well understood infinite family of graphs, or $|G_v|\leq 2^43^6$ or…

Combinatorics · Mathematics 2010-10-14 Primoz Potocnik , Pablo Spiga , Gabriel Verret

Let $G$ be a finite abelian group written additively with identity $0$, and $\Omega$ be an inverse closed generating subset of $G$ such that $0\notin \Omega$. We say that $ \Omega $ has the property \lq\lq{}$us$\rq\rq{} (unique summation),…

Group Theory · Mathematics 2021-05-13 S. Morteza Mirafzal

In this communication, the co-maximal subgroup graph $\Gamma(G)$ of a finite group $G$ is examined when $G$ is a finite nilpotent group, finite abelian group, dihedral group $D_n$, dicyclic group $Q_{2^n}$, and $p$-group. We derive the…

Combinatorics · Mathematics 2023-10-11 Pallabi Manna , Santanu Mandal , Manideepa Saha

Let $G=(V,E)$ be a simple graph. A set $S\subseteq V$ is independent set of $G$, if no two vertices of $S$ are adjacent. The independence number $\alpha(G)$ is the size of a maximum independent set in the graph. %An independent set with…

Combinatorics · Mathematics 2013-01-09 Saeid Alikhani , Saeed Mirvakili

Conduction graphs are defined here in order to elucidate at a glance the often complicated conduction behaviour of molecular graphs as ballistic molecular conductors. The graph $G^{\mathrm C}$ describes all possible conducting devices…

Combinatorics · Mathematics 2024-09-23 Aidan Birkinshaw , Patrick W. Fowler , Jan Goedgebeur , Jorik Jooken

The aim of this note is to provide a comprehensive treatment of the homotopy theory of $\Gamma$-$G$-spaces for $G$ a finite group. We introduce two level and stable model structures on $\Gamma$-$G$-spaces and exhibit Quillen adjunctions to…

Algebraic Topology · Mathematics 2014-05-01 Dominik Ostermayr

A nonpolycyclic nilpotent-by-cyclic group Gamma can be expressed as the HNN extension of a finitely-generated nilpotent group N. The first main result is that quasi-isometric nilpotent-by-cyclic groups are HNN extensions of quasi-isometric…

Group Theory · Mathematics 2007-05-23 Ashley Reiter Ahlin

An automorphism of a graph is called quasi-semiregular if it fixes a unique vertex of the graph and its remaining cycles have the same length. This kind of symmetry of graphs was first investigated by Kutnar, Malni\v{c}, Mart\'{i}nez and…

Combinatorics · Mathematics 2021-08-02 Fu-Gang Yin , Yan-Quan Feng , Jin-Xin Zhou , A-Hui Jia

Given a connected, locally finite, quasi-transitive graph $X$ which is quasi-isometric to a planar graph $\Gamma$, we remark that one can upgrade $\Gamma$ to be a planar Cayley graph, answering a question raised by Esperet--Giocanti and…

Combinatorics · Mathematics 2024-07-19 Joseph MacManus

The first part of the paper centers in the study of embeddability between partially commutative groups. In [KK], for a finite simplicial graph $\Gamma$, the authors introduce an infinite, locally infinite graph $\Gamma^e$, called the…

Group Theory · Mathematics 2015-06-11 Montserrat Casals-Ruiz

It is shown that, given any finite dimensional, split basic algebra $\Lambda = K\Gamma/I$ (where $\Gamma$ is a quiver and $I$ an admissible ideal in the path algebra $K \Gamma$), there is a finite list of affine algebraic varieties, the…

Representation Theory · Mathematics 2014-07-10 Birge Huisgen-Zimmermann

In this work we prove that, given a simplicial graph $\Gamma$ and a family $\mathcal{G}$ of linear groups over a domain $R$, the graph product $\Gamma\mathcal{G}$ is linear over $R[\underline t]$, where $\underline t$ is a tuple of finitely…

Group Theory · Mathematics 2022-03-09 Federico Berlai , Javier de la Nuez González

Let G be an amenable group, let X be a Banach space and let \pi : G --> B(X) be a bounded representation. We show that if the set {\pi(t) : t \in G} is gamma-bounded then \pi extends to a bounded homomorphism w : C*(G) --> B(X) on the group…

Functional Analysis · Mathematics 2010-03-09 Christian Le Merdy

We study representations of a Leavitt path algebra $L$ of a finitely separated digraph $\Gamma$ over a field. We show that the category of $L$-modules is equivalent to a full subcategory of quiver representations. When $\Gamma$ is a…

Rings and Algebras · Mathematics 2019-06-03 Ayten Koç , Murad Özaydın

The {\em metric dimension} of a graph $\Gamma$ is the least number of vertices in a set with the property that the list of distances from any vertex to those in the set uniquely identifies that vertex. We consider the Grassmann graph…

Combinatorics · Mathematics 2011-11-28 Robert F. Bailey , Karen Meagher