New Bounds for Codes Identifying Vertices in Graphs
, 1999 Let G = (V; E) be an undirected graph. Let C be a subset of vertices that we shall call a code. For any vertex v 2 V , the neighbouring set N(v; C) is the set of vertices of C at distance at most one from v.
Gerard Cohen +3 more
core
Robust Matchings, Maximum Clustering, and Maximum Capacitated Medians
, 1999 We consider complete graphs with nonnegative edge weights. A p-matching is a set of p disjoint edges. We prove the existence of a maximal (with respect to inclusion) matching M that contains for any p jM j p edges whose total weight is at least 1 p 2
Refael Hassin, Shlomi Rubinstein
core
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
List Edge Colourings of Some 1-Factorable Multigraphs
, 1996 The List Edge Colouring Conjecture asserts that, given any multigraph G with chromatic index k and any set system fSe : e 2 E(G)g with each jSe j = k, we can choose elements se 2 Se such that se 6= sf whenever e and f are adjacent edges.
Luis Goddyn, M. N. Ellingham
core
Matching criticality in intersecting hypergraphs
, 2017 The transversal number τ(H) of a hypergraph H is the minimum cardinality of a set of vertices that intersects all edges of H. The matching number α′(H) of H is the maximum cardinality of a matching in H. A hypergraph H is intersecting if and only if α′(H)
Ni, Zhenyu, Shan, Erfang, Kang, Liying
core
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