ARTICLES

Filter  
Active filters 0
Remove
  

Refine your searches by:

Collections
Education
Literature
Languages
Technology
Social Sciences
Religion
Research
Economy
Computing
History
all records (73)

Languages
English
Spanish
Portuguese
German
French

Countries
Indonesia
USA
Spain
Brazil
Ukraine
Australia
South Africa
Canada
Chile
Poland
all records (83)

Years
2023
2022
2021
2020
2019
2018
2017
2016
2015
2014
all records (24)

Filter  
 
7.056  Articles
1 of 707 pages  |  10  records  |  more records»
A graph G is perfect matching transitive, shortly PM-transitive, if for any two perfect matchings M1 and M2 of G, there is an automorphism f : V(G)?V(G) such that fe(M1)=M2, where fe(uv)=f(u)f(v). In ... see more

The stochastic Kronecker graph is a random structure whose vertex set is a hypercube and the probability of an edge depends on the structure of its ends. We prove that a.a.s. as soon as the stochastic Kronecker graph becomes connected it co... see more

The stochastic Kronecker graph is a random structure whose vertex set is a hypercube and the probability of an edge depends on the structure of its ends. We prove that a.a.s. as soon as the stochastic Kronecker graph becomes connected it co... see more

The perfect matching complex of a graph is the simplicial complex on the edge set of the graph with facets corresponding to perfect matchings of the graph. This paper studies the perfect matching complexes, Mp(Hk×m×n)\mathcal{M}_p(H_{k \times m\times n}),... see more

A Hamiltonian graph is 2-factor Hamiltonian (2FH) if each of its 2-factors is a Hamiltonian cycle. A similar, but weaker, property is the Perfect-Matching-Hamiltonian property (PMH-property): a graph admitting a perfect matching is said to have this prope... see more

In this paper we study the cycle descent statistic on permutations. Several involutions on permutations and derangements are constructed. Moreover, we construct a bijection between negative cycle descent permutations and Callan perfect matchings.

Let mGm_G denote the number of perfect matchings of the graph GG. We introduce a number of combinatorial tools for determining the parity of mGm_G and giving a lower bound on the power of 2 dividing mGm_G. In particular, we introduce certain vertex sets c... see more

In this note we construct two infinite snark families which have high oddness and low circumference compared to the number of vertices. Using this construction, we also give a counterexample to a suggested strengthening of Fulkerson's conjecture by showin... see more

 Utilization of information technology in a company will assist in increasing the productivity of the company in carrying out its duties and responsibilities. Distributors are the most important part in a company that provides medical equipment in ob... see more

1 of 707 pages  |  10  records  |  more records»