Cores, Joins and the Fano-Flow Conjectures
Discussiones Mathematicae Graph Theory, 2018 The Fan-Raspaud Conjecture states that every bridgeless cubic graph has three 1-factors with empty intersection. A weaker one than this conjecture is that every bridgeless cubic graph has two 1-factors and one join with empty intersection.
Jin Ligang +2 more
doaj +1 more source
Core Index of Perfect Matching Polytope for a 2-Connected Cubic Graph
Discussiones Mathematicae Graph Theory, 2018 For a 2-connected cubic graph G, the perfect matching polytope P(G) of G contains a special point xc=(13,13,…,13)$x^c = \left( {{1 \over 3},{1 \over 3}, \ldots ,{1 \over 3}} \right)$ . The core index ϕ(P(G)) of the polytope P(G) is the minimum number of
Wang Xiumei, Lin Yixun
doaj +1 more source
Connectivity Concepts in Intuitionistic Fuzzy Incidence Graphs with Application. [PDF]
Int J Appl Comput Math, 2022 Nazeer I, Rashid T.
europepmc +1 more source
A note on the edge general position number of cactus graphs
Open MathematicsFor a given graph G, a subset S of E(G) is an edge general position set of G if no triple of S is contained in a common shortest path. The cardinality of a largest edge general position set of G is called the edge general position number of G, denoted by
Cao Yahan, Ji Shengjin
doaj +1 more source
Degree-based topological properties of borophene sheets
Main Group Metal ChemistryThis study examines many innovative topological numbers and establishes mathematical interpretations for boron clusters and borophene coverings. The general Randic index, arithmetic index, and Albertson index are discussed in this work for the alpha ...
Al Khabyah Ali +3 more
doaj +1 more source
A sharp lower bound on the signless Laplacian index of graphs with (κ,τ)-regular sets
Special Matrices, 2018 A new lower bound on the largest eigenvalue of the signless Laplacian spectra for graphs with at least one (κ,τ)regular set is introduced and applied to the recognition of non-Hamiltonian graphs or graphs without a perfect matching.
Andeelić Milica +2 more
doaj +1 more source
C7-Decompositions of the Tensor Product of Complete Graphs
Discussiones Mathematicae Graph Theory, 2017 In this paper we consider a decomposition of Km × Kn, where × denotes the tensor product of graphs, into cycles of length seven. We prove that for m, n ≥ 3, cycles of length seven decompose the graph Km × Kn if and only if (1) either m or n is odd and (2)
Manikandan R.S., Paulraja P.
doaj +1 more source
NUMERICAL INTEGRATION ON GRAPHS: WHERE TO SAMPLE AND HOW TO WEIGH. [PDF]
Math Comput, 2020 Linderman GC, Steinerberger S.
europepmc +1 more source
Andronov-Hopf and Neimark-Sacker bifurcations in time-delay differential equations and difference equations with applications to models for diseases and animal populations. [PDF]
Adv Differ Equ, 2020 Darlai R, Moore EJ, Koonprasert S.
europepmc +1 more source
Further results on enumeration of perfect matchings of Cartesian product graphs
Open MathematicsCounting perfect matchings is an interesting and challenging combinatorial task. It has important applications in statistical physics and chemistry. As the general problem is #P-complete, it is usually tackled by randomized heuristics and approximation ...
Wu Tingzeng, Zeng Xiaolin
doaj +1 more source