The Linear t-Colorings of Sierpiński-Like Graphs

A proper t-coloring of a graph G is a mapping ${\varphi: V(G) \rightarrow [1, t]}$ such that ${\varphi(u) \neq \varphi(v)}$ if u and v are adjacent vertices, where t is a positive integer. The chromatic number of a graph G, denoted by ${\chi(G)}$ , is the minimum number of colors required in any proper coloring of G. A linear t-coloring of a graph is a proper t-coloring such that the graph induced by the vertices of any two color classes is the union of vertex-disjoint paths. The linear chromatic number of a graph G, denoted by ${lc(G)}$ , is the minimum t such that G has a linear t-coloring. In this paper, the linear t-colorings of Sierpiński-like graphs S(n, k), ${S^+(n, k)}$ and ${S^{++}(n, k)}$ are studied. It is obtained that ${lc(S(n, k))= \chi (S(n, k)) = k}$ for any positive integers n and k, ${lc(S^+(n, k)) = \chi(S^+(n, k)) = k}$ and ${lc(S^{++}(n, k)) = \chi(S^{++}(n, k)) = k}$ for any positive integers ${n \geq 2}$ and ${k \geq 3}$ . Furthermore, we have determined the number of paths and the length of each path in the subgraph induced by the union of any two color classes completely.     

Cops and Robber Game with a Fast Robber on Expander Graphs and Random Graphs

We consider a variant of the Cops and Robber game, in which the robber has unbounded speed, i.e., can take any path from her vertex in her turn, but she is not allowed to pass through a vertex occupied by a cop. Let ${c_{\infty}(G)}$ denote the number of cops needed to capture the robber in a graph G in this variant. We characterize graphs G with c _??(G) =? 1, and give an ${O( \mid V(G)\mid^2)}$ algorithm for their detection. We prove a lower bound for c _?? of expander graphs, and use it to prove three things. The first is that if ${np \geq 4.2 {\rm log}n}$ then the random graph ${G= \mathcal{G}(n, p)}$ asymptotically almost surely has ${\eta_{1}/p \leq \eta_{2}{\rm log}(np)/p}$ , for suitable positive constants ${\eta_{1}}$ and ${\eta_{2}}$ . The second is that a fixed-degree random regular graph G with n vertices asymptotically almost surely has ${c_{\infty}(G) = \Theta(n)}$ . The third is that if G is a Cartesian product of m paths, then ${n/4km^2 \leq c_{\infty}(G) \leq n/k}$ , where ${n = \mid V(G)\mid}$ and k is the number of vertices of the longest path.     

The Chvátal–Erdös Condition for Group Connectivity in Graphs

Let G be a graph and A an abelian group with the identity element 0 and ${|A| \geq 4}$ . Let D be an orientation of G. The boundary of a function ${f: E(G) \rightarrow A}$ is the function ${\partial f: V(G) \rightarrow A}$ given by ${\partial f(v) = \sum_{e \in E^+(v)}f(e) - \sum_{e \in E^-(v)}f(e)}$ , where ${v \in V(G), E^+(v)}$ is the set of edges with tail at v and ${E^-(v)}$ is the set of edges with head at v. A graph G is A-connected if for every b: V(G) → A with ${\sum_{v \in V(G)} b(v) = 0}$ , there is a function ${f: E(G) \mapsto A-\{0\}}$ such that ${\partial f = b}$ . A graph G is A-reduced to G′ if G′ can be obtained from G by contracting A-connected subgraphs until no such subgraph left. Denote by ${\kappa^{\prime}(G)}$ and α(G) the edge connectivity and the independent number of G, respectively. In this paper, we prove that for a 2-edge-connected simple graph G, if ${\kappa^{\prime}(G) \geq \alpha(G)-1}$ , then G is A-connected or G can be A-reduced to one of the five specified graphs or G is one of the 13 specified graphs.     

On uniformly bounded spherical functions in Hilbert space

Let G be a commutative group, written additively, with a neutral element 0, and let K be a finite group. Suppose that K acts on G via group automorphisms ${G \ni a \mapsto ka \in G}$ , ${k \in K}$ . Let ${{\mathfrak{H}}}$ be a complex Hilbert space and let ${{\mathcal L}({\mathfrak{H}})}$ be the algebra of all bounded linear operators on ${{\mathfrak{H}}}$ . A mapping ${u \colon G \to {\mathcal L}({\mathfrak{H}})}$ is termed a K-spherical function if it satisfies (1) ${|K|^{-1} \sum_{k\in K} u (a+kb)=u (a) u (b)}$ for any ${a,b\in G}$ , where |K| denotes the cardinality of K, and (2) ${u (0) = {\rm id}_{\mathfrak {H}},}$ where ${{\rm id}_{\mathfrak {H}}}$ designates the identity operator on ${{\mathfrak{H}}}$ . The main result of the paper is that for each K-spherical function ${u \colon G \to {\mathcal {L}}({\mathfrak {H}})}$ such that ${\| u \|_{\infty} = \sup_{a\in G} \| u (a)\|_{{\mathcal L}({\mathfrak{H}})} < \infty,}$ there is an invertible operator S in ${{\mathcal L}({\mathfrak{H}})}$ with ${\| S \| \, \| S^{-1}\| \leq |K| \, \| u \|_{\infty}^2}$ such that the K-spherical function ${{\tilde{u}} \colon G \to {\mathcal L}({\mathfrak{H}})}$ defined by ${{\tilde{u}}(a) = S u (a) S^{-1},\,a \in G,}$ satisfies ${{\tilde{u}}(-a) = {\tilde{u}}(a)^*}$ for each ${a \in G}$ . It is shown that this last condition is equivalent to insisting that ${{\tilde{u}}(a)}$ be normal for each ${a \in G}$ .     

Note on Group Distance Magic Graphs G[C 4]

A group distance magic labeling or a ${\mathcal{G}}$ -distance magic labeling of a graph G =  (V, E) with ${|V | = n}$ is a bijection f from V to an Abelian group ${\mathcal{G}}$ of order n such that the weight ${w(x) = \sum_{y\in N_G(x)}f(y)}$ of every vertex ${x \in V}$ is equal to the same element ${\mu \in \mathcal{G}}$ , called the magic constant. In this paper we will show that if G is a graph of order n =  2 ^p (2k + 1) for some natural numbers p, k such that ${\deg(v)\equiv c \mod {2^{p+1}}}$ for some constant c for any ${v \in V(G)}$ , then there exists a ${\mathcal{G}}$ -distance magic labeling for any Abelian group ${\mathcal{G}}$ of order 4n for the composition G[C ₄]. Moreover we prove that if ${\mathcal{G}}$ is an arbitrary Abelian group of order 4n such that ${\mathcal{G} \cong \mathbb{Z}_2 \times\mathbb{Z}_2 \times \mathcal{A}}$ for some Abelian group ${\mathcal{A}}$ of order n, then there exists a ${\mathcal{G}}$ -distance magic labeling for any graph G[C ₄], where G is a graph of order n and n is an arbitrary natural number.     

On Group Choosability of Graphs,II

Given a group A and a directed graph G, let F(G, A) denote the set of all maps ${f : E(G) \rightarrow A}$ . Fix an orientation of G and a list assignment ${L : V(G) \mapsto 2^A}$ . For an ${f \in F(G, A)}$ , G is (A, L, f)-colorable if there exists a map ${c:V(G) \mapsto \cup_{v \in V(G)}L(v)}$ such that ${c(v) \in L(v)}$ , ${\forall v \in V(G)}$ and ${c(x)-c(y)\neq f(xy)}$ for every edge e = xy directed from x to y. If for any ${f\in F(G,A)}$ , G has an (A, L, f)-coloring, then G is (A, L)-colorable. If G is (A, L)-colorable for any group A of order at least k and for any k-list assignment ${L:V(G) \rightarrow 2^A}$ , then G is k-group choosable. The group choice number, denoted by ${\chi_{gl}(G)}$ , is the minimum k such that G is k-group choosable. In this paper, we prove that every planar graph is 5-group choosable, and every planar graph with girth at least 5 is 3-group choosable. We also consider extensions of these results to graphs that do not have a K ₅ or a K _3,3 as a minor, and discuss group choosability versions of Hadwiger’s and Woodall’s conjectures.     

Positive definite superfunctions and unitary representations of lie supergroups

For a broad class of Fréchet-Lie supergroups $ \mathcal{G} $ , we prove that there exists a correspondence between positive definite smooth (resp., analytic) superfunctions on $ \mathcal{G} $ and matrix coefficients of smooth (resp., analytic) unitary representations of the Harish-Chandra pair (G, $ \mathfrak{g} $ ) associated to $ \mathcal{G} $ . As an application, we prove that a smooth positive definite superfunction on $ \mathcal{G} $ is analytic if and only if it restricts to an analytic function on the underlying manifold of $ \mathcal{G} $ . When the underlying manifold of $ \mathcal{G} $ is 1-connected we obtain a necessary and sufficient condition for a linear functional on the universal enveloping algebra U( $ {{\mathfrak{g}}_{\mathbb{C}}} $ ) to correspond to a matrix coefficient of a unitary representation of (G, $ \mathfrak{g} $ ). The class of Lie supergroups for which the aforementioned results hold is characterised by a condition on the convergence of the Trotter product formula. This condition is strictly weaker than assuming that the underlying Lie group of $ \mathcal{G} $ is a locally exponential Fréchet-Lie group. In particular, our results apply to examples of interest in representation theory such as mapping supergroups and diffeomorphism supergroups.     

The Signed k-Submatchings in Graphs

A signed k-submatching of a graph G is a function f : E(G) → {?1,1} satisfying f (E _G (v)) ≤ 1 for at least k vertices ${v \in V(G)}$ . The maximum of the values of f (E(G)), taken over all signed k-submatchings f, is called the signed k-submatching number and is denoted by ${\beta_S^{k}(G)}$ . In this paper, sharp bounds on ${\beta_S^{k}(G)}$ for general graphs are presented. Exact values of ${\beta_S^{k}(G)}$ for several classes of graphs are found.     

The geometric meaning of Zhelobenko operators

Let $ \mathfrak{g} $ be the complex semisimple Lie algebra associated to a complex semisimple algebraic group G, $ \mathfrak{b} $ a Borel subalgebra of $ \mathfrak{g} $ , $ \mathfrak{h}\subset \mathfrak{b} $ the Cartan sublagebra, and N ? G the unipotent subgroup corresponding to the nilradical $ \mathfrak{n}\subset \mathfrak{b} $ . We show that the explicit formula for the extremal projection operator for $ \mathfrak{g} $ obtained by Asherova, Smirnov, and Tolstoy and similar formulas for Zhelobenko operators are related to the existence of a birational equivalence $ N\times \mathfrak{h}\to \mathfrak{b} $ given by the restriction of the adjoint action. Simple geometric proofs of formulas for the “classical” counterparts of the extremal projection operator and of Zhelobenko operators are also obtained.     

Equal Quasi-Partition of p-Groups

Let S be a subgroup of a group G. A set ${\Pi= \{H_1, \ldots , H_n\}}$ of subgroups ${H_i (i = 1, \ldots ,n)}$ with ${G=\cup_{H_i\in\Pi}H_i}$ is said to be an equal quasi-partition of G if ${H_i\cap H_j\cong S}$ and ${|H_i|=|H_j|}$ for all ${H_i, H_j\in\Pi}$ with ${i\ne j}$ . In this paper we investigate finite p-groups such that a subset of their maximal subgroups form an equal quasi-partition.     

On Zero-Sum {\mathbb{Z}_k} -Magic Labelings of 3-Regular Graphs

Let G =  (V, E) be a finite loopless graph and let (A, +) be an abelian group with identity 0. Then an A-magic labeling of G is a function ${\phi}$ from E into A ? {0} such that for some ${a \in A, \sum_{e \in E(v)} \phi(e) = a}$ for every ${v \in V}$ , where E(v) is the set of edges incident to v. If ${\phi}$ exists such that a =  0, then G is zero-sum A-magic. Let zim(G) denote the subset of ${\mathbb{N}}$ (the positive integers) such that ${1 \in zim(G)}$ if and only if G is zero-sum ${\mathbb{Z}}$ -magic and ${k \geq 2 \in zim(G)}$ if and only if G is zero-sum ${\mathbb{Z}_k}$ -magic. We establish that if G is 3-regular, then ${zim(G) = \mathbb{N} - \{2\}}$ or ${\mathbb{N} - \{2,4\}.}$      

Metrization of Weighted Graphs

We find a set of necessary and sufficient conditions under which the weight ${w: E \rightarrow \mathbb{R}^{+}}$ on the graph G = (V, E) can be extended to a pseudometric ${d : V \times V \rightarrow \mathbb{R}^{+}}$ . We describe the structure of graphs G for which the set ${\mathfrak{M}_{w}}$ of all such extensions contains a metric whenever w is strictly positive. Ordering ${\mathfrak{M}_{w}}$ by the pointwise order, we have found that the posets $({\mathfrak{M}_{w}, \leqslant)}$ contain the least elements ρ _0,w if and only if G is a complete k-partite graph with ${k \, \geqslant \, 2}$ . In this case the symmetric functions ${f : V \times V \rightarrow \mathbb{R}^{+}}$ , lying between ρ _0,w and the shortest-path pseudometric, belong to ${\mathfrak{M}_{w}}$ for every metrizable w if and only if the cardinality of all parts in the partition of V is at most two.     

The Majorization Theorem for Signless Laplacian Spectral Radii of Connected Graphs

Let ${\pi=(d_{1},d_{2},\ldots,d_{n})}$ and ${\pi'=(d'_{1},d'_{2},\ldots,d'_{n})}$ be two non-increasing degree sequences. We say ${\pi}$ is majorizated by ${\pi'}$ , denoted by ${\pi \vartriangleleft \pi'}$ , if and only if ${\pi\neq \pi'}$ , ${\sum_{i=1}^{n}d_{i}=\sum_{i=1}^{n}d'_{i}}$ , and ${\sum_{i=1}^{j}d_{i}\leq\sum_{i=1}^{j}d'_{i}}$ for all ${j=1,2,\ldots,n}$ . If there exists one connected graph G with ${\pi}$ as its degree sequence and ${c=(\sum_{i=1}^{n}d_{i})/2-n+1}$ , then G is called a c-cyclic graph and ${\pi}$ is called a c-cyclic degree sequence. Suppose ${\pi}$ is a non-increasing c-cyclic degree sequence and ${\pi'}$ is a non-increasing graphic degree sequence, if ${\pi \vartriangleleft \pi'}$ and there exists some t ${(2\leq t\leq n)}$ such that ${d'_{t}\geq c+1}$ and ${d_{i}=d'_{i}}$ for all ${t+1\leq i\leq n}$ , then the majorization ${\pi \vartriangleleft \pi'}$ is called a normal majorization. Let μ(G) be the signless Laplacian spectral radius, i.e., the largest eigenvalue of the signless Laplacian matrix of G. We use C _π to denote the class of connected graphs with degree sequence π. If ${G \in C_{\pi}}$ and ${\mu(G)\geq \mu(G')}$ for any other ${G'\in C_{\pi}}$ , then we say G has greatest signless Laplacian radius in C _π . In this paper, we prove that: Let π and π′ be two different non-increasing c-cyclic (c ≥ 0) degree sequences, G and G′ be the connected c-cyclic graphs with greatest signless Laplacian spectral radii in C _π and C _π', respectively. If ${\pi \vartriangleleft \pi'}$ and it is a normal majorization, then ${\mu(G) < \mu(G')}$ . This result extends the main result of Zhang (Discrete Math 308:3143–3150, 2008).     

Some results on metric n-Lie algebras

We study the structure of a metric n-Lie algebra G over the complex field C. Let G = SR be the Levi decomposition, where R is the radical of G and S is a strong semisimple subalgebra of G. Denote by m(G) the number of all minimal ideals of an indecomposable metric n-Lie algebra and R ⊥ the orthogonal complement of R. We obtain the following results. As S-modules, R ⊥ is isomorphic to the dual module of G/R. The dimension of the vector space spanned by all nondegenerate invariant symmetric bilinear forms on G is equal to that of the vector space of certain linear transformations on G; this dimension is greater than or equal to m(G) + 1. The centralizer of R in G is equal to the sum of all minimal ideals; it is the direct sum of R ⊥ and the center of G. Finally, G has no strong semisimple ideals if and only if R⊥■R.     

Alternating groups and flag-transitive triplanes

Let ${\mathcal{D}}$ be a nontrivial triplane, and G be a subgroup of the full automorphism group of ${\mathcal{D}}$ . In this paper we prove that if ${\mathcal{D}}$ is a triplane, ${G\leq Aut(\mathcal{D})}$ is flag-transitive, point-primitive and Soc(G) is an alternating group, then ${\mathcal{D}}$ is the projective space PG ₂(3, 2), and ${G\cong A_7}$ with the point stabiliser ${G_x\cong PSL_3(2)}$ .     

On the Broadcast Independence Number of Grid Graph

A broadcast on a nontrivial connected graph G is a function ${f:V \longrightarrow \{0, \ldots,\operatorname{diam}(G)\}}$ such that for every vertex ${v \in V(G)}$ , ${f(v) \leq e(v)}$ , where ${\operatorname{diam}(G)}$ denotes the diameter of G and e(v) denotes the eccentricity of vertex v. The broadcast independence number is the maximum value of ${\sum_{v \in V} f(v)}$ over all broadcasts f that satisfy ${d(u,v) > \max \{f(u), f(v)\}}$ for every pair of distinct vertices u, v with positive values. We determine this invariant for grid graphs ${G_{m,n} = P_m \square P_n}$ , where ${2 \leq m \leq n}$ and □ denotes the Cartesian product. We hereby answer one of the open problems raised by Dunbar et al. in (Discrete Appl Math 154:59–75, 2006).     

The Signed Edge-Domatic Number of a Graph

For a nonempty graph G = (V, E), a signed edge-domination of G is a function ${f: E(G) \to \{1,-1\}}$ such that ${\sum_{e'\in N_{G}[e]}{f(e')} \geq 1}$ for each ${e \in E(G)}$ . The signed edge-domatic number of G is the largest integer d for which there is a set {f ₁,f ₂, . . . , f _d } of signed edge-dominations of G such that ${\sum_{i=1}^{d}{f_i(e)} \leq 1}$ for every ${e \in E(G)}$ . This paper gives an original study on this concept and determines exact values for some special classes of graphs, such as paths, cycles, stars, fans, grids, and complete graphs with even order.     

Symmetric diameter two graphs with affine-type vertex-quasiprimitive automorphism group

We study the class of G-symmetric graphs Γ with diameter 2, where G is an affine-type quasiprimitive group on the vertex set of Γ. These graphs arise from normal quotient analysis as basic graphs in the class of symmetric diameter 2 graphs. It is known that ${G \cong V \rtimes G_0}$ , where V is a finite-dimensional vector space over a finite field and G ₀ is an irreducible subgroup of GL (V), and Γ is a Cayley graph on V. In particular, we consider the case where ${V = \mathbb {F}_p^d}$ for some prime p and G ₀ is maximal in GL (d, p), with G ₀ belonging to the Aschbacher classes ${\mathcal {C}_2, \mathcal {C}_4, \mathcal {C}_6, \mathcal {C}_7}$ , and ${\mathcal {C}_8}$ . For ${G_0 \in \mathcal {C}_i, i = 2,4,8}$ , we determine all diameter 2 graphs which arise. For ${G_0 \in \mathcal {C}_6, \mathcal {C}_7}$ we obtain necessary conditions for diameter 2, which restrict the number of unresolved cases to be investigated, and in some special cases determine all diameter 2 graphs.     

Irregular and Singular Loci of Commuting Varieties

Let $ {\user1{\mathcal{C}}} $ be the commuting variety of the Lie algebra $ \mathfrak{g} $ of a connected noncommutative reductive algebraic group G over an algebraically closed field of characteristic zero. Let $ {\user1{\mathcal{C}}}^{{{\text{sing}}}} $ be the singular locus of $ {\user1{\mathcal{C}}} $ and let $ {\user1{\mathcal{C}}}^{{{\text{irr}}}} $ be the locus of points whose G-stabilizers have dimension > rk G. We prove that: (a) $ {\user1{\mathcal{C}}}^{{{\text{sing}}}} $ is a nonempty subset of $ {\user1{\mathcal{C}}}^{{{\text{irr}}}} $ ; (b) $ {\text{codim}}_{{\user1{\mathcal{C}}}} \,{\user1{\mathcal{C}}}^{{{\text{irr}}}} = 5 - {\text{max}}\,l{\left( \mathfrak{a} \right)} $ where the maximum is taken over all simple ideals $ \mathfrak{a} $ of $ \mathfrak{g} $ and $ l{\left( \mathfrak{a} \right)} $ is the “lacety” of $ \mathfrak{a} $ ; and (c) if $ \mathfrak{t} $ is a Cartan subalgebra of $ \mathfrak{g} $ and $ \alpha \in \mathfrak{t}^{*} $ root of $ \mathfrak{g} $ with respect to $ \mathfrak{t} $ , then $ \overline{{G{\left( {{\text{Ker}}\,\alpha \times {\text{Ker }}\alpha } \right)}}} $ is an irreducible component of $ {\user1{\mathcal{C}}}^{{{\text{irr}}}} $ of codimension 4 in $ {\user1{\mathcal{C}}} $ . This yields the bound $ {\text{codim}}_{{\user1{\mathcal{C}}}} \,{\user1{\mathcal{C}}}^{{{\text{sing}}}} \geqslant 5 - {\text{max}}\,l{\left( \mathfrak{a} \right)} $ and, in particular, $ {\text{codim}}_{{\user1{\mathcal{C}}}} \,{\user1{\mathcal{C}}}^{{{\text{sing}}}} \geqslant 2 $ . The latter may be regarded as an evidence in favor of the known longstanding conjecture that $ {\user1{\mathcal{C}}} $ is always normal. We also prove that the algebraic variety $ {\user1{\mathcal{C}}} $ is rational.     

Toughness and Matching Extension in {\mathcal{P}_3}-Dominated Graphs

Let G be a connected graph. For ${x,y\in V(G)}$ with d(x, y) = 2, we define ${J(x,y)= \{u \in N(x)\cap N(y)\mid N[u] \subseteq N[x] \,{\cup}\,N[y] \}}$ and ${J'(x,y)= \{u \in N(x) \cap N(y)\,{\mid}\,{\rm if}\ v \in N(u){\setminus}(N[x] \,{\cup}\, N[y])\ {\rm then}\ N[x] \,{\cup}\, N[y]\,{\cup}\,N[u]{\setminus}\{x,y\}\subseteq N[v]\}}$ . A graph G is quasi-claw-free if ${J(x,y) \not= \emptyset}$ for each pair (x, y) of vertices at distance 2 in G. Broersma and Vumar (in Math Meth Oper Res. doi:10.1007/s00186-008-0260-7) introduced ${\mathcal{P}_{3}}$ -dominated graphs defined as ${J(x,y)\,{\cup}\, J'(x,y)\not= \emptyset}$ for each ${x,y \in V(G)}$ with d(x, y) = 2. This class properly contains that of quasi-claw-free graphs, and hence that of claw-free graphs. In this note, we prove that a 2-connected ${\mathcal{P}_3}$ -dominated graph is 1-tough, with two exceptions: K _2,3 and K _1,1,3, and prove that every even connected ${\mathcal{P}_3}$ -dominated graph ${G\ncong K_{1,3}}$ has a perfect matching. Moreover, we show that every even (2p + 1)-connected ${\mathcal{P}_3}$ -dominated graph is p-extendable. This result follows from a stronger result concerning factor-criticality of ${\mathcal{P}_3}$ -dominated graphs.