Related papers: The Separated Box Product of Two Digraphs
Many data types arising from data mining applications can be modeled as bipartite graphs, examples include terms and documents in a text corpus, customers and purchasing items in market basket analysis and reviewers and movies in a movie…
We investigate the algebro-geometric structure of a novel two-parameter quantum deformation which exhibits the nature of a semidirect or cross-product algebra built upon GL(2) x GL(1), and is related to several other known examples of…
In factoring matrices into the product of two matrices operations are typically performed with elements restricted to matrix subspaces. Such modest structural assumptions are realistic, for example, in large scale computations. This paper…
Signed graphs have their edges labeled either as positive or negative. Here we introduce two types of signed distance matrix for signed graphs. We characterize balance in signed graphs using these matrices and we obtain explicit formulae…
Brylawski's tensor product formula expresses the Tutte polynomial of the tensor product of two graphs in terms of Tutte polynomials arising from the tensor factors. We are concerned with extensions of Brylawski's tensor product formula to…
We study two variants of the problem of contact representation of planar graphs with axis-aligned boxes. In a cube-contact representation we realize each vertex with a cube, while in a proportional box-contact representation each vertex is…
An arithmetical structure on a graph is given by a labeling of the vertices which satisfies certain divisibility properties. In this note, we look at several families of graphs and attempt to give counts on the number of arithmetical…
The power graph $P(G)$ of a finite group $G$ is the graph with vertex set $G$ and two distinct vertices are adjacent if either of them is a power of the other. Here we show that the power graph $P(G_1 \times G_2)$ of the direct product of…
Assume that there is a free group action of automorphisms on a bipartite graph. If there is a perfect matching on the factor graph, then obviously there is a perfect matching on the graph. Surprisingly, the reversed is also true for…
For every probability $p\in[0,1]$ we define a distance-based graph property, the $p$TS-distance-balancedness, that in the case $p=0$ coincides with the standard distance-balancedness, and in the case $p=1$ is related to the…
A regular cover of a connected graph is called {\em cyclic} or {\em dihedral} if its transformation group is cyclic or dihedral respectively, and {\em arc-transitive} (or {\em symmetric}) if the fibre-preserving automorphism subgroup acts…
We introduce a new notation for representing labeled regular bipartite graphs of arbitrary degree. Several enumeration problems for labeled and unlabeled regular bipartite graphs have been introduced. A general algorithm for enumerating all…
The distinguishing number (index) $D(G)$ ($D'(G)$) of a graph $G$ is the least integer $d$ such that $G$ has an vertex labeling (edge labeling) with $d$ labels that is preserved only by a trivial automorphism. The lexicographic product of…
In this note, we extend results about unique $n^{\textrm{th}}$ roots and cancellation of finite disconnected graphs with respect to the Cartesian, the strong and the direct product, to the rooted hierarchical products, and to a modified…
In this paper, we look into Signed Product Cordial Labeling for Splitting Graphs of Bull graph and Splitting graph of Star graph , Square of Path graph, Coronaand also for the graph obtained by joining two copies of Helm by a Path of…
This paper considers the edge-connectivity and restricted edge-connectivity of replacement product graphs, gives some bounds on edge-connectivity and restricted edge-connectivity of replacement product graphs and determines the exact values…
We construct the crossed product of a C(X)-algebra by an endomorphism, in such a way that the endomorphism itself becomes induced by the bimodule of continuous sections of a vector bundle. Some motivating examples for such a construction…
Symmetric product orbifolds, i.e. permutation orbifolds of the full symmetric group S_{n} are considered by applying the general techniques of permutation orbifolds. Generating functions for various quantities, e.g. the torus partition…
Although the Cayley-Dickson algebras are twisted group algebras, little attention has been paid to the nature of the Cayley-Dickson twist. One reason is that the twist appears to be highly chaotic and there are other interesting things…
We study analytic properties of graph product of finite groups with a hyperbolic defining graph. This is done by studying dynamics on the Bowditch compactification of the extension graph, or the crossing graph, of graph product. In…