Results 31 to 40 of about 973,826 (351)

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, Valerie Fernandez, Teodora Punzalan, Jonecis Dayap   +3 more
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

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, Fu Ruiqin, Lu Xuefei, Guo Mengxia, Zhao Zhiqin   +4 more
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 Combinatorics
Motivated 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, Sanghita Ghosh, Joseph Varghese Kureethara, V. M. Abraham   +3 more
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

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, DEDI SUHAIMI, MARWAN RAMLI, SYARIFAH MEURAH YUNI, IKHSAN MAULIDI   +4 more
doaj   +1 more source

A STUDY ON PERFECT ITALIAN DOMINATION OF GRAPHS AND THEIR COMPLEMENTS

Ural Mathematical Journal
Perfect Italian Domination is a type of vertex domination  which can also be viewed as a graph labelling problem. The vertices of a graph \(G\) are labelled by 0, 1 or 2 in such a way that a vertex labelled 0 should have a neighbourhood with exactly two ...
Agnes Poovathingal, Joseph Varghese Kureethara   +1 more
doaj   +1 more source

Design method of nonsubsampled graph filter banks

Dianzi Jishu Yingyong, 2019
In order to overcome the problem that it is difficult to accurately define the downsampling operation for a generalized graph signal in graph filter banks, this paper focuses on the design algorithm of nonsubsampled graph filter banks.
Yang Sheng
doaj   +1 more source

Contractions in perfect graphs

Discrete Applied Mathematics
In this paper, we characterize the class of {\em contraction perfect} graphs which are the graphs that remain perfect after the contraction of any edge set. We prove that a graph is contraction perfect if and only if it is perfect and the contraction of any single edge preserves its perfection.
Alexandre Dupont-Bouillard, Pierre Fouilhoux, Roland Grappe, Mathieu Lacroix 0001   +3 more
openaire   +2 more sources