相关论文: Dot-product graphs in finite fields

We introduce probability-graphons which are probability kernels that generalize graphons to the case of weighted graphs. Probability-graphons appear as the limit objects to study sequences of large weighted graphs whose distribution of…

The study of graph products is a major research topic and typically concerns the term $f(G*H)$, e.g., to show that $f(G*H)=f(G)f(H)$. In this paper, we study graph products in a non-standard form $f(R[G*H]$ where $R$ is a "reduction", a…

Sets satisfying Central sets theorem and other Ramsey theoretic large sets were studied extensively in literature. Hindman and Strauss proved that product of some of these large sets is again large. In this paper we show that if we take two…

A set $S$ of vertices of a graph $G$ is a dominating set in $G$ if every vertex outside of $S$ is adjacent to at least one vertex belonging to $S$. A domination parameter of $G$ is related to those sets of vertices of a graph satisfying…

We determine all the ways in which a direct product of two finite groups can be expressed as the set-theoretical union of proper subgroups in a family of minimal cardinality.

In recent work, the authors developed a simple method of constructing topological spaces from certain well-behaved partially ordered sets -- those coming from sequences of relations between finite sets. This method associates a given poset…

For affine symmetric groups we construct finite $W$-graphs corresponding to two-row shapes, and prove their uniqueness. This gives the first non-trivial family of examples of finite $W$-graphs in an affine type. We compare our construction…

We prove that the class of residually C groups is closed under taking graph products, provided that C is closed under taking subgroups, finite direct products and that free-by-C groups are residually C. As a consequence, we show that local…

Let $G$ and $H$ be graphs, and $G\boxtimes H$ the strong product of $G$ and $H$. We prove that for any connected graphs $G$ and $H$ there is a strongly connected orientation $D$ of $G\boxtimes H$ such that ${\rm diam}(D)\leq 2r+15$, where…

Equivalence relations on the edge set of a graph $G$ that satisfy restrictive conditions on chordless squares play a crucial role in the theory of Cartesian graph products and graph bundles. We show here that such relations in a natural way…

We completely classify the locally finite, infinite graphs with pure mapping class groups admitting a coarsely bounded generating set. We also study algebraic properties of the pure mapping class group: We establish a semidirect product…

In graph-theoretical terms, an edge in a graph connects two vertices while a hyperedge of a hypergraph connects any more than one vertices. If the hypergraph's hyperedges further connect the same number of vertices, it is said to be…

Graph products of monoids provide a common framework for free products and direct products. Trace monoids are graph products of finitely generated free monoids. We investigate the interaction of certain finitary conditions with graph…

A graph property (i.e., a set of graphs) is induced-hereditary or additive if it is closed under taking induced-subgraphs or disjoint unions. If $\cP$ and $\cQ$ are properties, the product $\cP \circ \cQ$ consists of all graphs $G$ for…

A graph is well-covered if every maximal independent set has the same cardinality, namely the vertex independence number. We answer a question of Topp and Volkmann and prove that if the Cartesian product of two graphs is well-covered, then…

We describe an underlying right angled building structure of any graph product of buildings. We describe the automorphism group of the graph product of buildings. We show that the notion of generalized graph product of a collection of…

Due to the advantage of tunability via size, shape, doping and relatively low level of loss and high extent of spatial confinement, graphene quantum dots (GQDs) are emerging as an effective way to control light by molecular engineering. The…

This paper is concerned with the fast computation of a relation $\R$ on the edge set of connected graphs that plays a decisive role in the recognition of approximate Cartesian products, the weak reconstruction of Cartesian products, and the…

A matching $M$ in a graph $\Gamma$ is positive if $\Gamma$ has a vertex-labeling such that $M$ coincides with the set of edges with positive weights. A positive matching decomposition (pmd) of $\Gamma$ is an edge-partition $M_1,\ldots,M_p$…

Given a finite group G, let cd(G) denote the set of degrees of the irreducible complex characters of G. The character degree graph of G is defined as the simple undirected graph whose vertices are the prime divisors of the numbers in cd(G),…