scholarly journals Vertex-Transitive Direct Products of Graphs

10.37236/6999 ◽  
2018 ◽  
Vol 25 (2) ◽  
Author(s):  
Richard H. Hammack ◽  
Wilfried Imrich
Keyword(s):  
Direct Product ◽  
Direct Products ◽  
Odd Cycle ◽  
Vertex Transitive ◽  
Odd Cycles

It is known that for graphs $A$ and $B$ with odd cycles, the direct product $A\times B$ is vertex-transitive if and only if both $A$ and $B$ are vertex-transitive. But this is not necessarily true if one of $A$ or $B$ is bipartite, and until now there has been no characterization of such vertex-transitive direct products. We prove that if $A$ and $B$ are both bipartite, or both non-bipartite, then $A\times B$ is vertex-transitive if and only if both $A$ and $B$ are vertex-transitive. Also, if $A$ has an odd cycle and $B$ is bipartite, then $A\times B$ is vertex-transitive if and only if both $A\times K_2$ and $B$ are vertex-transitive.

scholarly journals On Cycles, Attackers and Supporters --- A Contribution to The Investigation of Dynamics in Abstract Argumentation

2021 ◽  
Author(s):  
Ringo Baumann ◽  
Markus Ulbricht
Keyword(s):  
Knowledge Representation ◽  
Main Part ◽  
Research Area ◽  
Knowledge Representation And Reasoning ◽  
Major Research ◽  
Abstract Argumentation ◽  
Odd Cycle ◽  
The Impact ◽  
Odd Cycles

Abstract argumentation as defined by Dung in his seminal 1995 paper is by now a major research area in knowledge representation and reasoning. Dynamics of abstract argumentation frameworks (AFs) as well as syntactical consequences of semantical facts of them are the central issues of this paper. The first main part is engaged with the systematical study of the influence of attackers and supporters regarding the acceptability status of whole sets and/or single arguments. In particular, we investigate the impact of addition or removal of arguments, a line of research that has been around for more than a decade. Apart from entirely new results, we revisit, generalize and sum up similar results from the literature. To gain a comprehensive formal and intuitive understanding of the behavior of AFs we put special effort in comparing different kind of semantics. We concentrate on classical admissibility-based semantics and also give pointers to semantics based on naivity and weak admissibility, a recently introduced mediating approach. In the second main part we show how to infer syntactical information from semantical one. For instance, it is well-known that if a finite AF possesses no stable extension, then it has to contain an odd-cycle. In this paper, we even present a characterization of this issue. Moreover, we show that the change of the number of extensions if adding or removing an argument allows to conclude the existence of certain even or odd cycles in the considered AF without having further information.

scholarly journals Subnormal subgroups in direct products of groups

1987 ◽  
Vol 42 (2) ◽  
pp. 147-172 ◽  
Author(s):  
Peter Hauck
Keyword(s):  
Lie Algebras ◽  
Direct Product ◽  
Main Part ◽  
Direct Products ◽  
Products Of Groups ◽  
Special Cases ◽  
Associative Rings ◽  
Subnormal Subgroups

AbstractA group G is called normally (subnormally) detectable if the only normal (subnormal) subgroups in any direct product G1 × … × Gn of copies of G are just the direct factors Gi. We give an internal characterization of finite subnormally detectable groups and obtain analogous results for associative rings and for Lie algebras. The main part of the paper deals with a study of normally detectable groups, where we verify a conjecture of T. O. Hawkes in a number of special cases.

scholarly journals ON NEAR-RING IDEMPOTENTS AND POLYNOMIALS ON DIRECT PRODUCTS OF Ω-GROUPS

2001 ◽  
Vol 44 (2) ◽  
pp. 379-388 ◽  
Author(s):  
Erhard Aichinger
Keyword(s):  
Direct Product ◽  
Subject Classification ◽  
Idempotent Element ◽  
Direct Products ◽  
Primary 16Y30 ◽  
Secondary 08A40

AbstractLet $N$ be a zero-symmetric near-ring with identity, and let $\sGa$ be a faithful tame $N$-group. We characterize those ideals of $\sGa$ that are the range of some idempotent element of $N$. Using these idempotents, we show that the polynomials on the direct product of the finite $\sOm$-groups $V_1,V_2,\dots,V_n$ can be studied componentwise if and only if $\prod_{i=1}^nV_i$ has no skew congruences.AMS 2000 Mathematics subject classification: Primary 16Y30. Secondary 08A40

scholarly journals A note on compact and compact circular edge-colorings of graphs

2008 ◽  
Vol Vol. 10 no. 3 (Graph and Algorithms) ◽  
Author(s):  
Dariusz Dereniowski ◽  
Adam Nadolski
Keyword(s):  
Approximation Algorithm ◽  
Decision Problem ◽  
Edge Coloring ◽  
Exact Algorithm ◽  
Weighted Graphs ◽  
Edge Colorings ◽  
Odd Cycle ◽  
International Audience ◽  
Np Complete ◽  
Odd Cycles

Graphs and Algorithms International audience We study two variants of edge-coloring of edge-weighted graphs, namely compact edge-coloring and circular compact edge-coloring. First, we discuss relations between these two coloring models. We prove that every outerplanar bipartite graph admits a compact edge-coloring and that the decision problem of the existence of compact circular edge-coloring is NP-complete in general. Then we provide a polynomial time 1:5-approximation algorithm and pseudo-polynomial exact algorithm for compact circular coloring of odd cycles and prove that it is NP-hard to optimally color these graphs. Finally, we prove that if a path P2 is joined by an edge to an odd cycle then the problem of the existence of a compact circular coloring becomes NP-complete.

scholarly journals Neighborhood Reconstruction and Cancellation of Graphs

10.37236/6676 ◽  
2017 ◽  
Vol 24 (2) ◽  
Author(s):  
Richard H. Hammack ◽  
Cristina Mullican
Keyword(s):  
Direct Product ◽  
Structural Characterization ◽  
Unsolved Problem ◽  
Reconstruction Problem ◽  
Cancellation Problem ◽  
Open Vertex ◽  
Isomorphic Graphs ◽  
Product Of Graphs

We connect two seemingly unrelated problems in graph theory.Any graph $G$ has a neighborhood multiset $\mathscr{N}(G)= \{N(x) \mid x\in V(G)\}$ whose elements are precisely the open vertex-neighborhoods of $G$. In general there exist non-isomorphic graphs $G$ and $H$ for which $\mathscr{N}(G)=\mathscr{N}(H)$. The neighborhood reconstruction problem asks the conditions under which $G$ is uniquely reconstructible from its neighborhood multiset, that is, the conditions under which $\mathscr{N}(G)=\mathscr{N}(H)$ implies $G\cong H$. Such a graph is said to be neighborhood-reconstructible.The cancellation problem for the direct product of graphs seeks the conditions under which $G\times K\cong H\times K$ implies $G\cong H$. Lovász proved that this is indeed the case if $K$ is not bipartite. A second instance of the cancellation problem asks for conditions on $G$ that assure $G\times K\cong H\times K$ implies $G\cong H$ for any bipartite~$K$ with $E(K)\neq \emptyset$. A graph $G$ for which this is true is called a cancellation graph.We prove that the neighborhood-reconstructible graphs are precisely the cancellation graphs. We also present some new results on cancellation graphs, which have corresponding implications for neighborhood reconstruction. We are particularly interested in the (yet-unsolved) problem of finding a simple structural characterization of cancellation graphs (equivalently, neighborhood-reconstructible graphs).

scholarly journals Ramsey Numbers of Trees Versus Odd Cycles

10.37236/5731 ◽  
2016 ◽  
Vol 23 (3) ◽  
Author(s):  
Matthew Brennan
Keyword(s):  
Positive Integer ◽  
Constant Factor ◽  
Linear Functions ◽  
Ramsey Numbers ◽  
Odd Cycle ◽  
Odd Cycles

Burr, Erdős, Faudree, Rousseau and Schelp initiated the study of Ramsey numbers of trees versus odd cycles, proving that $R(T_n, C_m) = 2n - 1$ for all odd $m \ge 3$ and $n \ge 756m^{10}$, where $T_n$ is a tree with $n$ vertices and $C_m$ is an odd cycle of length $m$. They proposed to study the minimum positive integer $n_0(m)$ such that this result holds for all $n \ge n_0(m)$, as a function of $m$. In this paper, we show that $n_0(m)$ is at most linear. In particular, we prove that $R(T_n, C_m) = 2n - 1$ for all odd $m \ge 3$ and $n \ge 25m$. Combining this with a result of Faudree, Lawrence, Parsons and Schelp yields $n_0(m)$ is bounded between two linear functions, thus identifying $n_0(m)$ up to a constant factor.

Topologies of Lattice Products

1966 ◽  
Vol 18 ◽  
pp. 1004-1014 ◽  
Author(s):  
Richard A. Alo ◽  
Orrin Frink
Keyword(s):  
Direct Product ◽  
Partially Ordered Set ◽  
Ordered Set ◽  
Order Relation ◽  
Direct Products ◽  
Ordered Sets ◽  
Partially Ordered

A number of different ways of defining topologies in a lattice or partially ordered set in terms of the order relation are known. Three of these methods have proved to be useful and convenient for lattices of special types, namely the ideal topology, the interval topology, and the new interval topology of Garrett Birkhoff. In another paper (2) we have shown that these three topologies are equivalent for chains (totally ordered sets), where they reduce to the usual intrinsic topology of the chain.Since many important lattices are either direct products of chains or sublattices of such products, it is natural to ask what relationships exist between the various order topologies of a direct product of lattices and those of the lattices themselves.

Semigroup Compactifications of Direct and Semidirect Products

1983 ◽  
Vol 26 (2) ◽  
pp. 233-240 ◽  
Author(s):  
Paul Milnes
Keyword(s):  
Direct Product ◽  
Semidirect Product ◽  
Classical Result ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Direct Products ◽  
Almost Periodic ◽  
Semidirect Products ◽  
Semigroup Compactifications ◽  
Necessary And Sufficient

AbstractA classical result of I. Glicksberg and K. de Leeuw asserts that the almost periodic compactification of a direct product S × T of abelian semigroups with identity is (canonically isomorphic to) the direct product of the almost periodic compactiflcations of S and T. Some efforts have been made to generalize this result and recently H. D. Junghenn and B. T. Lerner have proved a theorem giving necessary and sufficient conditions for an F-compactification of a semidirect product S⊗σT to be a semidirect product of compactiflcations of S and T. A different such theorem is presented here along with a number of corollaries and examples which illustrate its scope and limitations. Some behaviour that can occur for semidirect products, but not for direct products, is exposed

On Nilpotent Products of Cyclic Groups

1960 ◽  
Vol 12 ◽  
pp. 447-462 ◽  
Author(s):  
Ruth Rebekka Struik
Keyword(s):  
Abelian Group ◽  
Direct Product ◽  
Finite Abelian Group ◽  
Nilpotent Groups ◽  
Multiplication Table ◽  
Direct Products ◽  
Free Products ◽  
Cyclic Groups ◽  
Special Cases ◽  
Product Of Groups

In this paper G = F/Fn is studied for F a free product of a finite number of cyclic groups, and Fn the normal subgroup generated by commutators of weight n. The case of n = 4 is completely treated (F/F2 is well known; F/F3 is completely treated in (2)); special cases of n > 4 are studied; a partial conjecture is offered in regard to the unsolved cases. For n = 4 a multiplication table and other properties are given.The problem arose from Golovin's work on nilpotent products ((1), (2), (3)) which are of interest because they are generalizations of the free and direct product of groups: all nilpotent groups are factor groups of nilpotent products in the same sense that all groups are factor groups of free products, and all Abelian groups are factor groups of direct products. In particular (as is well known) every finite Abelian group is a direct product of cyclic groups. Hence it becomes of interest to investigate nilpotent products of finite cyclic groups.

Sign in / Sign up

Export Citation Format

Share Document