Results 21 to 30 of about 59,692 (266)
Theory and Applications of Graphs, 2022 Given an edge-colored complete graph Kn on n vertices, a perfect (respectively, near-perfect) matching M in Kn with an even (respectively, odd) number of vertices is rainbow if all edges have distinct colors.
Shuhei Saitoh, Naoki Matsumoto, Wei Wu
doaj +1 more source
Perfect Outer-connected Domination in the Join and Corona of Graphs
Recoletos Multidisciplinary Research Journal, 2016 Let πΊ be a connected simple graph. A dominating set π β π(πΊ) is called a perfect dominating set of πΊ if each π’ β π πΊ β π is dominated by exactly one element of π.
Enrico Enriquez +3 more
doaj +1 more source
Finding a Strong Stable Set or a Meyniel Obstruction in any Graph [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 A strong stable set in a graph $G$ is a stable set that contains a vertex of every maximal clique of $G$. A Meyniel obstruction is an odd circuit with at least five vertices and at most one chord.
Kathie Cameron, Jack Edmonds
doaj +1 more source
A note on pm-compact bipartite graphs
Discussiones Mathematicae Graph Theory, 2014 A graph is called perfect matching compact (briefly, PM-compact), if its perfect matching graph is complete. Matching-covered PM-compact bipartite graphs have been characterized. In this paper, we show that any PM-compact bipartite graph G with Ξ΄ (G) β₯ 2
Liu Jinfeng, Wang Xiumei
doaj +1 more source
Bounds on perfect k-domination in trees: an algorithmic approach [PDF]
Opuscula Mathematica, 2012 Let \(k\) be a positive integer and \(G = (V;E)\) be a graph. A vertex subset \(D\) of a graph \(G\) is called a perfect \(k\)-dominating set of \(G\) if every vertex \(v\) of \(G\) not in \(D\) is adjacent to exactly \(k\) vertices of \(D\). The minimum
B. Chaluvaraju, K. A. Vidya
doaj +1 more source
OPEN PACKING NUMBER FOR SOME CLASSES OF PERFECT GRAPHS
Ural Mathematical Journal, 2020 Let \(G\) be a graph with the vertex set \(V(G)\).Β A subset \(S\) of \(V(G)\) is an open packing set of \(G\) if every pair of vertices in \(S\) has no common neighbor in \(G.\)Β The maximum cardinality of an open packing set of \(G\) is theΒ open ...
K. Raja Chandrasekar, S. Saravanakumar
doaj +1 more source
Formalizing Randomized Matching Algorithms [PDF]
Logical Methods in Computer Science, 2012 Using Je\v{r}\'abek 's framework for probabilistic reasoning, we formalize the correctness of two fundamental RNC^2 algorithms for bipartite perfect matching within the theory VPV for polytime reasoning.
Dai Tri Man Le, Stephen A. Cook
doaj +1 more source
A characterization of star-perfect graphs
AKCE International Journal of Graphs and CombinatoricsMotivated by Berge perfect graphs, we define star-perfect graphs and characterize them. For a finite simple graph G(V, E), let [Formula: see text] denote the minimum number of induced stars contained in G such that the union of their vertex sets is V(G),
G Ravindra +3 more
doaj +1 more source
Perfect codes in power graphs of finite groups
Open Mathematics, 2017 The power graph of a finite group is the graph whose vertex set is the group, two distinct elements being adjacent if one is a power of the other. The enhanced power graph of a finite group is the graph whose vertex set consists of all elements of the ...
Ma Xuanlong +4 more
doaj +1 more source
Non-perfect maze generation using Kruskal algorithm
Jurnal Natural, 2021 A non-perfect maze is a maze that contains loop or cycle and has no isolated cell. A non-perfect maze is an alternative to obtain a maze that cannot be satisfied by perfect maze.
MAHYUS IHSAN +4 more
doaj +1 more source