Results 71 to 80 of about 405,795 (217)
List colorings with distinct list sizes, the case of complete bipartite graphs [PDF]
, 2011 Zoltán Füredi, Ida Kantor
openalex +1 more source
Integral complete r-partite graphs
Discrete Mathematics, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wang, Ligong +2 more
openaire +2 more sources
Decomposing certain equipartite graphs into sunlet graphs of length 2p
AKCE International Journal of Graphs and Combinatorics, 2016 For any integer r≥3, we define the sunlet graph of order 2r, denoted L2r, as the graph consisting of a cycle of length r together with r pendant vertices, each adjacent to exactly one vertex of the cycle.
Abolape D. Akwu +1 more
doaj +1 more source
Some Properties of the Nil-Graphs of Ideals of Commutative Rings
پژوهشهای ریاضی, 2022 Let R be a commutative ring with identity and Nil(R) be the set of nilpotent elements of R. The nil-graph of ideals of R is defined as the graph AG_N(R) whose vertex set is {I:(0)and there exists a non-trivial ideal such that and two distinct vertices
Reza Nikandish
doaj
The external field effect on the opinion formation based on the majority rule and the q-voter models on the complete graph [PDF]
, 2022 Azhari Hasibuan, Roni Muslim
openalex +1 more source
Landauer Principle and Einstein Synchronization of Clocks: Ramsey Approach
EntropyWe introduce a synchronization procedure for clocks based on the Einstein–Landauer framework. Clocks are modeled as discrete, macroscopic devices operating at a thermal equilibrium temperature T.
Edward Bormashenko, Michael Nosonovsky
doaj +1 more source
Long Paths in First Passage Percolation on the Complete Graph II. Global Branching Dynamics. [PDF]
J Stat Phys, 2020 Eckhoff M +3 more
europepmc +1 more source
Decompositions of the λ-Fold Complete Mixed Graph into Mixed 6-Stars
AppliedMathGraph and digraph decompositions are a fundamental part of design theory. Probably the best known decompositions are related to decomposing the complete graph into 3-cycles (which correspond to Steiner triple systems), and decomposing the complete ...
Robert Gardner, Kazeem Kosebinu
doaj +1 more source
Efficient Circuit Implementations of Continuous-Time Quantum Walks for Quantum Search
EntropyQuantum walks are a powerful framework for simulating complex quantum systems and designing quantum algorithms, particularly for spatial search on graphs, where the goal is to find a marked vertex efficiently.
Renato Portugal, Jalil Khatibi Moqadam
doaj +1 more source
, 2011 In this paper, we provide three new operations on fuzzy graphs; namely direct product, semi-strong product and strong product.We give sufficient conditions for each one of them to be complete and we show that if any of these products is complete, then at least one factor is a complete fuzzy graph. Moreover, we introduce and study the notion of balanced
openaire +1 more source