English
Related papers

Related papers: On the Index of Diffie-Hellman Mapping

200 papers

The distinguishing index $D'(\Gamma)$ of a graph $\Gamma$ is the least number $k$ such that $\Gamma$ has an edge-coloring with $k$ colors preserved only by the trivial automorphism. In this paper we prove that if the automorphism group of a…

Combinatorics · Mathematics 2021-07-21 Mariusz Grech , Andrzej Kisielewicz

Let $\Gamma=\mathrm{Cay}(G,S)$ be a Cayley digraph on a group $G$ and let $A=\mathrm{Aut}(\Gamma)$. The Cayley index of $\Gamma$ is $|A:G|$. It has previously been shown that, if $p$ is a prime, $G$ is a cyclic $p$-group and $A$ contains a…

Combinatorics · Mathematics 2017-03-08 Luke Morgan , Joy Morris , Gabriel Verret

We fix a field $\kk$ of characteristic $p$. For a finite group $G$ denote by $\delta(G)$ and $\sigma(G)$ respectively the minimal number $d$, such that for any finite dimensional representation $V$ of $G$ over $\kk$ and any $v\in…

Commutative Algebra · Mathematics 2014-06-25 Jonathan Elmer , Martin Kohls

The harmonic index of a graph $G$, is defined as the sum of weights $\frac{2}{d(u)+d(v)}$ of all edges $uv$ of $G$, where $d(u)$ is the degree of the vertex $u$ in $G$. In this paper we find the minimum harmonic index of bicyclic graph of…

Combinatorics · Mathematics 2020-11-12 A. Abdolghafourian , Mohammad A. Iranmanesh

The distinguishing number (index) $D(G)$ ($D'(G)$) of a graph $G$ is the least integer $d$ such that $G$ has an vertex (edge) labeling with $d$ labels that is preserved only by the trivial automorphism. It is known that for every graph $G$…

Combinatorics · Mathematics 2017-08-11 Saeid Alikhani , Sandi Klavžar , Florian Lehner , Samaneh Soltani

The distinguishing number $D(\Gamma)$ of a graph $\Gamma$ is the least size of a partition of the vertices of $\Gamma$ such that no non-trivial automorphism of $\Gamma$ preserves this partition. We show that if the automorphism group of a…

Combinatorics · Mathematics 2020-06-16 Mariusz Grech , Andrzej Kisielewicz

Let $g\geq3$ and $n\geq0$, and let ${\mathcal{M}}_{g,n}$ be the mapping class group of a surface of genus $g$ with $n$ boundary components. We prove that ${\mathcal{M}}_{g,n}$ contains a unique subgroup of index $2^{g-1}(2^{g}-1)$ up to…

Geometric Topology · Mathematics 2014-02-26 Luis Paris , Jon A Berrick , Volker Gebhardt

Let $M(N_{h,n})$ denote the mapping class group of a compact nonorientable surface of genus $h\ge 7$ and $n\le 1$ boundary components, and let $T(N_{h,n})$ be the subgroup of $M(N_{h,n})$ generated by all Dehn twists. It is known that…

Geometric Topology · Mathematics 2017-02-09 Blazej Szepietowski

A cyclic subgroup $N$ of a finite group $G$ is called a uni-width subgroup of $G$ if $N$ is the unique cyclic subgroup of $G$ of order $|N|$. In this article, we prove that a finite group $G$ admits a unique largest uni-width subgroup…

Group Theory · Mathematics 2026-01-23 Siddhartha Sarkar

For a sequence $d$ of non-negative integers, let ${\cal G}(d)$ and ${\cal F}(d)$ be the sets of all graphs and forests with degree sequence $d$, respectively. Let $\gamma_{\min}(d)=\min\{ \gamma(G):G\in {\cal G}(d)\}$,…

Combinatorics · Mathematics 2015-07-17 Michael Gentner , Michael A. Henning , Dieter Rautenbach

The distinguishing number (index) $D(G)$ ($D'(G)$) of a graph $G$ is the least integer $d$ such that $G$ has an vertex (edge) labeling with $d$ labels that is preserved only by the trivial automorphism. It is known that for every graph $G$…

Combinatorics · Mathematics 2017-10-24 Saeid Alikhani , Samaneh Soltani

Let $\Gamma=(K_n,H)$ be a signed complete graph whose negative edges induce a subgraph $H$. Let $A(\Gamma)$ be the adjacency matrix of the signed graph $\Gamma$. The largest eigenvalue of $A(\Gamma)$ is called the index of $\Gamma$. In this…

Combinatorics · Mathematics 2024-09-04 Ziyi Fang , Fan Chen , Xiying Yuan

There are two algebraic lower bounds of the number of n-periodic points of a self-map f:M\to M of a compact smooth manifold of dimension at least 3 : NF_n(f)=min {#Fix(g^n) ;g\sim f; g continuous} and NJD_n(f)=min {#Fix}(g^n) ;g\sim f; g…

Algebraic Topology · Mathematics 2017-10-11 Jerzy Jezierski

Let $G$ be a finite group written multiplicatively. By a sequence over $G$, we mean a finite sequence of terms from $G$ which is unordered, repetition of terms allowed, and we say that it is a product-one sequence if its terms can be…

Number Theory · Mathematics 2012-11-13 A. Geroldinger , D. J. Grynkiewicz

By adapting the notion of chirality group, the duality group of $\cal H$ can be defined as the the minimal subgroup $D({\cal H}) \trianglelefteq Mon({\cal H})$ such that ${\cal H}/D({\cal H})$ is a self-dual hypermap (a hypermap isomorphic…

Combinatorics · Mathematics 2011-01-26 Daniel Pinto

A connected, locally finite graph $\Gamma$ is a Cayley--Abels graph for a totally disconnected, locally compact group $G$ if $G$ acts vertex-transitively with compact, open vertex stabilizers on $\Gamma$. Define the minimal degree of $G$ as…

Group Theory · Mathematics 2021-05-27 Arnbjörg Soffía Árnadóttir , Waltraud Lederle , Rögnvaldur G. Möller

It is known that every semigroup of normal completely positive maps $P = {P_t: t\geq 0}$ of $B(H)$, satisfying $P_t(1) = 1$ for every $t\geq 0$, has a minimal dilation to an E_0-semigroup acting on $B(K)$ for some Hilbert space K containing…

funct-an · Mathematics 2008-02-03 William Arveson

Let G be a digraph (without parallel edges) such that every directed cycle has length at least four; let $\beta(G)$ denote the size of the smallest subset X in E(G) such that $G\X$ has no directed cycles, and let $\gamma(G)$ be the number…

Combinatorics · Mathematics 2012-11-01 Maria Chudnovsky , Paul Seymour , Blair D. Sullivan

For a graph $G$, the $\gamma$-graph of $G$, $G(\gamma)$, is the graph whose vertices correspond to the minimum dominating sets of $G$, and where two vertices of $G(\gamma)$ are adjacent if and only if their corresponding dominating sets in…

Combinatorics · Mathematics 2017-07-10 C. M. Mynhardt , L. E. Teshima

Let $\Gamma=(K_{n},H^-)$ be a signed complete graph whose negative edges induce a subgraph $H$. The index of $\Gamma$ is the largest eigenvalue of its adjacency matrix. In this paper we study the index of $\Gamma$ when $H$ is a unicyclic…

Combinatorics · Mathematics 2021-02-08 N. Kafai , F. Heydari , N. Jafari Rad , M. Maghasedi
‹ Prev 1 2 3 10 Next ›