Related papers: Certain t-partite graphs
A (partial) Latin square is a table of multiplication of a (partial) quasigroup. Multiplication of a (partial) quasigroup may be considered as a set of triples. We give a necessary and sufficient condition when a set of triples is a…
As a generalization of orbit-polynomial and distance-regular graphs, we introduce the concept of a quotient-polynomial graph. In these graphs every vertex $u$ induces the same regular partition around $u$, where all vertices of each cell…
Latin tableaux are a generalization of Latin squares, which first appeared in the early 2000's in a paper of Chow, Fan, Goemans, and Vondr\'{a}k. Here, we extend the notion of isotopy, a permutation group action, from Latin squares to Latin…
We introduce a condition on arrays in some way maximally distinct from Latin square condition, as well as some other conditions on algebras, graphs and $0,1$-matrices. We show that these are essentially the same structures, generalising a…
A latin square of order $n$ is an $n\times n$ array of $n$ symbols in which each symbol occurs exactly once in each row and column. A transversal of such a square is a set of $n$ entries such that no two entries share the same row, column…
The main thrust of the article is to provide interesting example, useful for students of using bitwise operations in the programming languages C ++ and Java. As an example, we describe an algorithm for obtaining a Latin square of arbitrary…
We consider a set of cliques in any multipartite graph with two vertices in each part. Moreover, we construct a class of peculiar polytopes. Key words: multipartite graph, clique, polytope.
In this paper we consider the separability problem for bipartite quantum states arising from graphs. Earlier it was proved that the degree criterion is the graph-theoretic counterpart of the familiar positive partial transpose criterion for…
In this survey of graph polynomials, we emphasize the Tutte polynomial and a selection of closely related graph polynomials. We explore some of the Tutte polynomial's many properties and applications and we use the Tutte polynomial to…
We introduce orbital graphs and discuss some of their basic properties. Then we focus on their usefulness for search algorithms for permutation groups, including finding the intersection of groups and the stabilizer of sets in a group.
The structural balance of a signed graph is known to be necessary and sufficient to obtain a bipartite consensus among agents with friend-foe relationships. In the real world, relationships are multifarious, and the coexistence of different…
A graph is a data structure composed of dots (i.e. vertices) and lines (i.e. edges). The dots and lines of a graph can be organized into intricate arrangements. The ability for a graph to denote objects and their relationships to one…
Orthogonal polynomials on quadratic curves in the plane are studied. These include orthogonal polynomials on ellipses, parabolas, hyperbolas, and two lines. For an integral with respect to an appropriate weight function defined on any…
We introduce several classes of quantum combinatorial designs, namely quantum Latin squares, cubes, hypercubes and a notion of orthogonality between them. A further introduced notion, quantum orthogonal arrays, generalizes all previous…
Recently, Braunstein et al. [1] introduced normalized Laplacian matrices of graphs as density matrices in quantum mechanics and studied the relationships between quantum physical properties and graph theoretical properties of the underlying…
In this paper, a survey about recent progress on problems solved using graph amalgamations is presented, along with some new results with complete proofs, and some related open problems.
A broader definition of generalized truncations of graphs is introduced followed by an exploration of some standard concepts and parameters with regard to generalized truncations.
A transitive decomposition of a graph is a partition of the edge or arc set giving a set of subgraphs which are preserved and permuted transitively by a group of automorphisms of the graph. In this paper we give some background to the study…
A new general decomposition theory inspired from modular graph decomposition is presented. This helps unifying modular decomposition on different structures, including (but not restricted to) graphs. Moreover, even in the case of graphs,…
Quantum Latin squares are a generalization of classical Latin squares in quantum field and have wide applications in unitary error bases, mutually unbiased bases, $k$-uniform states and quantum error correcting codes. In this paper, we put…