Results 61 to 70 of about 30,248 (245)
Edge-Transitive Lexicographic and Cartesian Products
Discussiones Mathematicae Graph Theory, 2016 In this note connected, edge-transitive lexicographic and Cartesian products are characterized. For the lexicographic product G ◦ H of a connected graph G that is not complete by a graph H, we show that it is edge-transitive if and only if G is edge ...
Imrich Wilfried +3 more
doaj +1 more source
On transitive one-factorizations of arc-transitive graphs
, 2007 It is shown that transitive 1-factorizations of arc-transitive graphs exist if and only if certain factorizations of their automorphism groups exist.
Fang, X. G. +4 more
core +1 more source
On a Clique‐Building Game of Erdős
Journal of Graph Theory, EarlyView.ABSTRACT The following game was introduced in a list of open problems from 1983 attributed to Erdős: two players take turns claiming edges of a Kn ${K}_{n}$ until all edges are exhausted. Player 1 wins the game if the largest clique that they claim at the end is strictly larger than the largest clique of their opponent; otherwise, Player 2 wins the ...
Alexandru Malekshahian, Sam Spiro
wiley +1 more source
On the Hardness of Switching to a Small Number of Edges
Journal of Graph Theory, EarlyView.ABSTRACT Seidel's switching is a graph operation which makes a given vertex adjacent to precisely those vertices to which it was non‐adjacent before, while keeping the rest of the graph unchanged. Two graphs are called switching‐equivalent if one can be made isomorphic to the other one by a sequence of switches. Jelínková et al. [DMTCS 13, no. 2, 2011]
Vít Jelínek +2 more
wiley +1 more source
A Min–Max Relation on Dicuts and Dijoins in Weighted Chordal Digraphs
Journal of Graph Theory, EarlyView.ABSTRACT In a digraph, a dicut is a cut where all the arcs cross in one direction. A dijoin is a subset of arcs that intersects every dicut. Edmonds and Giles conjectured that in a weighted digraph, the minimum weight of a dicut is equal to the maximum size of a packing of dijoins. This has been disproved. However, the unweighted version conjectured by
Gérard Cornuéjols, Siyue Liu, R. Ravi
wiley +1 more source
Advance of performance modeling for Turbo receivers
Tongxin xuebao, 2014 Aiming at the performance modeling for Turbo receivers,the research results are summarized,in the mean-while,the characteristics and future trends are concluded in terms of equivalent model,transitive parameter,performance abstraction and transitive ...
Yun XUE, Bin JIANG, Xi-qi GAO
doaj +2 more sources
Reduction of Neutrosophic Fuzzy Matrices Using Implication Operator [PDF]
Neutrosophic Sets and SystemsThis research explores the reduction of Neutrosophic Fuzzy Matrices (NFMs) and highlights their significant properties, focusing particularly on nilpotent NFMs.
K. Karuppiah +5 more
doaj +1 more source
Computing a T-transitive opening of a proximity
, 2008 8th International Conference on Fuzzy Logic and Intelligent Technologies in Nuclear Science. Madrid, Spain, 21-24 September 2008A fast method to compute a T-indistinguishability from a reflexive and symmetric fuzzy relation is given for any left ...
Garmendia Salvador, Luis +2 more
core +1 more source
Modelling Critical Impeding Factors of Gamification Adoption: An ISM‐MICMAC Analysis
Global Business and Organizational Excellence, EarlyView.ABSTRACT Gamification is a transformative technology that attracts consumers and motivates them toward desired actions through fun and engagement. Despite its growing popularity and influence on user behavior, gamification faces significant challenges in acceptance and implementation due to behavioral, technological, economic, and regulatory factors ...
Wamika Sharma +4 more
wiley +1 more source
Weakly Flag-transitive Configurations and Half-arc-transitive Graphs
, 1999 A configuration is weakly flag-transitive if its group of automorphisms acts intransitively on flags but the group of all automorphisms and anti-automorphisms acts transitively on flags.
Pisanski, Tomaž, Marušič, Dragan
core +1 more source