Related papers: Cycle and Circle Tests of Balance in Gain Graphs: …
A $\{0,1\}$-matrix $\mathsf{A}$ is balanced if it does not contain a submatrix of odd order having exactly two 1's per row and per column. A graph is balanced if its clique-matrix is balanced. No characterization of minimally unbalanced…
Necessary condition to have Hamiltonian cycle in planar graph is given. Examples of regular planar graphs degree three without Hamiltonian cycle are built.
A signed complete graph contains both positive and negative Hamiltonian cycles if and only if it also contains both positive and negative triangles. Otherwise, all Hamiltonian cycles are negative if and only if all triangles are negative…
In the graph sharing game, two players share a connected graph $G$ with non-negative weights assigned to the vertices, claiming and collecting the vertices of $G$ one by one, while keeping the set of all claimed vertices connected through…
The parity of the length of paths and cycles is a classical and well-studied topic in graph theory and theoretical computer science. The parity constraints can be extended to label constraints in a group-labeled graph, which is a directed…
The power graph of a group $G$, denoted as $P(G)$, constitutes a simple undirected graph characterized by its vertex set $G$. Specifically, vertices $a,b$ exhibit adjacency exclusively if $a$ belongs to the cyclic subgroup generated by $b$…
We introduce the cycle intersection graph of a graph, an adaptation of the cycle graph of a graph, and use the structure of these graphs to prove an upper bound for the decycling number of all even graphs. This bound is shown to be…
A graph is called a GRR if its automorphism group acts regularly on its vertex-set. Such a graph is necessarily a Cayley graph. Godsil has shown that there are only two infinite families of finite groups that do not admit GRRs : abelian…
A $biased\ graph$ is a pair $(G,\mathcal{B})$, where $G$ is a graph and $\mathcal{B}$ is a collection of `balanced' circuits of $G$ such that no $\Theta$-subgraph of $G$ contains precisely two balanced circuits. We prove a Ramsey-type…
We revisit results obtained in [F. Harary, U. Peled, Hamiltonian threshold graphs, Discrete Appl.~Math., 16 (1987), 11--15], where several necessary and necessary and sufficient conditions for a connected threshold graph to be Hamiltonian…
An interval graph is considered improper if and only if it has a representation such that an interval contains another interval. Previously these have been investigated in terms of balance and minimal forbidden interval subgraphs for the…
In a graph G, the cardinality of the smallest ordered set of vertices that distinguishes every element of V (G)[E(G) is called the mixed metric dimension of G. In this paper we first establish the exact value of the mixed metric dimension…
Pontryagin duality provides a powerful tool for analyzing the structure and properties of locally compact abelian groups, in particular finite abelian groups. Now much can be done with non-abelian groups via the construction of character…
This study presents an abelian group approach to analyzing inconsistency in pairwise comparisons. However, it wrongly assumes that an inconsistency indicator can take values in any abelian linearly ordered group. The followup publication…
We associate a graph $\mathcal{C}_G$ to a non locally cyclic group $G$ (called the non-cyclic graph of $G$) as follows: take $G\backslash Cyc(G)$ as vertex set, where $Cyc(G)=\{x\in G | < x,y> \text{is cyclic for all} y\in G\}$ is called…
This paper develops a fundamental theory of realizations of linear and group codes on general graphs using elementary group theory, including basic group duality theory. Principal new and extended results include: normal realization…
A graph is weakly perfect if its clique number and chromatic number are equal. We show that the enhanced power graph of a finite group $G$ is weakly perfect: its clique number and chromatic number are equal to the maximum order of an…
In this paper, we study different forbidden subgraph characterizations of the prime-order element graph $\Gamma(G)$ defined on a finite group $G$. Its set of vertices is the group $G$ and two vertices $x,y \in G$ are adjacent if the order…
A subgroup H of G=(Z/dZ)^* is called balanced if every coset of H is evenly distributed between the lower and upper halves of G, i.e., has equal numbers of elements with representatives in (0,d/2) and (d/2,d). This notion has applications…
Finding a Hamilton graph from simple connected graphs is an important problem in discrete mathematics and computer science. Grinberg Theorem is a well-known necessary condition for planar Hamilton graphs. It divides a plane into two parts:…