Results 71 to 80 of about 59,293 (196)
Discrete Mathematics, 1996 A graph \(G\) is said to be \(k\)-extendable if \(G\) contains a perfect matching, has more than \(2k\) vertices, and every matching of size \(k\) can be extended to a perfect matching. This concept was introduced by \textit{M. D. Plummer} [Discrete Math. 31, 201-210 (1980; Zbl 0442.05060)]. The main result is that for positive integers \(n\) and \(k\)
Pavol Gvozdjak, Jaroslav Nesetril
openaire +1 more source
Independent sets and cuts in large-girth regular graphs [PDF]
, 2016 We present a local algorithm producing an independent set of expected size $0.44533n$ on large-girth 3-regular graphs and $0.40407n$ on large-girth 4-regular graphs.
Csóka, Endre
core +1 more source
Fractional List Packing for Layered Graphs
Journal of Graph Theory, EarlyView.ABSTRACT The fractional list packing number χ ℓ • ( G ) ${\chi }_{\ell }^{\bullet }(G)$ of a graph G $G$ is a graph invariant that has recently arisen from the study of disjoint list‐colourings. It measures how large the lists of a list‐assignment L : V ( G ) → 2 N $L:V(G)\to {2}^{{\mathbb{N}}}$ need to be to ensure the existence of a “perfectly ...
Stijn Cambie, Wouter Cames van Batenburg
wiley +1 more source
Superconnectivity of graphs with odd girth g and even girth h
Discrete Applied Mathematics, 2009 A maximally connected graph G of minimum degree δ is said to be superconnected (for short super-κ) if all disconnecting sets of cardinality δ are the neighborhood of some vertex of degree δ. Sufficient conditions on the diameter to guarantee that a graph of odd girth g and even girth h ≥ g + 3 is super-κ are stated.
Montejano, Luis P. +2 more
openaire +4 more sources
Efficient algorithm for calculating short cycles in Tanner graph based on matrix computation
Tongxin xuebao, 2017 Loop distribution of Tanner graph affects the BER performance of low-density parity-check codes(LDPC) decoding.To count short cycles in the Tanner graph efficiently,a side by side recursion algorithm based on matrix computation was proposed.Firstly,5 ...
Qing ZHU +4 more
doaj
Horse Ammunition. From the History of a Saddle
Вестник Волгоградского государственного университета. Серия 4. История, регионоведение, международные отношения, 2019 Introduction. Horse ammunition was formed historically on a large geographical area. The most important component of it is a saddle. The ancient history of a saddle is not sufficiently investigated.
Sergey I. Lukyashko
doaj +1 more source
On General Reduced Second Zagreb Index of Graphs
Mathematics, 2022 Graph-based molecular structure descriptors (often called “topological indices”) are useful for modeling the physical and chemical properties of molecules, designing pharmacologically active compounds, detecting environmentally hazardous substances, etc.
Lkhagva Buyantogtokh +2 more
doaj +1 more source
Orientations of Graphs With at Most One Directed Path Between Every Pair of Vertices
Journal of Graph Theory, EarlyView.ABSTRACT Given a graph G $G$, we say that an orientation D $D$ of G $G$ is a KT orientation if, for all u , v ∈ V ( D ) $u,v\in V(D)$, there is at most one directed path (in any direction) between u $u$ and v $v$. Graphs that admit such orientations have been used to construct graphs with large chromatic number and small clique number that served as ...
Barbora Dohnalová +3 more
wiley +1 more source
The Journal of Wildlife Management, EarlyView.Individual wild pig bait site visitation and time to initial detection is primarily influenced by space use (i.e., proximity to bait) and whether wild pigs from other social groups visited before. Specifically, females are less likely to visit a bait site if an adult male visits a site before them.
Sydney M. Brewer +2 more
wiley +1 more source
A revival of the girth conjecture
Journal of Combinatorial Theory, Series B, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tomás Kaiser +2 more
openaire +2 more sources