ARTICLES

Filter  
Active filters 0
Remove
  

Refine your searches by:

Collections
Mathematics
Technology
Education
Literature
Languages
Social Sciences
Computing
Religion
History
Economy
all records (74)

Languages
English
Spanish
Portuguese
German
French

Countries
Indonesia
Australia
USA
Spain
Brazil
Chile
Ukraine
Italy
South Africa
Poland
all records (81)

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

Filter  
 
7.152  Articles
1 of 716 pages  |  10  records  |  more records»
During the last decades, different types of decompositions have been processed in the field of graph theory. In various problems, for example in the construction of recognition algorithms, frequently appears the so-called weakly decomposition of graphs.Po... see more

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

In this paper we enumerate the parameter matrices of all perfect 2-colorings of the generalized Petersen graphs GP(n, 3), where n = 7. We also give some basic results for GP(n, k).

A r-perfect code in a graph G = (V(G),E(G)) is a subset C of V(G) for which the balls of radius r centered at the vertices of C form a partition of V(G). In this paper, we study the existence of perfect codes in corona product and generalized hierarchical... 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

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

Let G=(V,E)G=(V,E) be a graph. If GG is a König graph or if GG is a graph without 3-cycles and 5-cycles, we prove that the following conditions are equivalent: ?G\Delta_{G} is pure shellable, R/I?R/I_{\Delta} is Cohen-Macaulay, GG is unmixed vertex decomp... see more

We survey known results on enhanced power graphs of finite groups. Open problems, questions and suggestions for future work are also included.

1 of 716 pages  |  10  records  |  more records»