Zobrazeno 1 - 10
of 2 135
pro vyhledávání: '"Perfect graph"'
Publikováno v:
Discrete Mathematics Letters, Vol 13, Pp 128-134 (2024)
Externí odkaz:
https://doaj.org/article/53ba0a947f24456d9685100c86bc5202
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 21, Iss 2, Pp 189-197 (2024)
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
Externí odkaz:
https://doaj.org/article/0c92adf226be4743b50d59c1951b5035
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 21, Iss 2, Pp 143-151 (2024)
In this paper, we prove that the study of the comaximal graph of a finite commutative ring with identity is the same as the study of the zero-divisor graph of the specially constructed lattice. Also, we introduce the blow-up of a Boolean lattice usin
Externí odkaz:
https://doaj.org/article/3e1a890475374118952224b69559b4d5
Autor:
David Schaller, Tom Hartmann, Manuel Lafond, Peter F. Stadler, Nicolas Wieseke, Marc Hellmuth
Publikováno v:
Algorithms for Molecular Biology, Vol 18, Iss 1, Pp 1-43 (2023)
Abstract Background Evolutionary scenarios describing the evolution of a family of genes within a collection of species comprise the mapping of the vertices of a gene tree T to vertices and edges of a species tree S. The relative timing of the last c
Externí odkaz:
https://doaj.org/article/fc59eef7fb02402f8207917ae7fe7ca0
Publikováno v:
International Journal of Group Theory, Vol 11, Iss 4, Pp 221-228 (2022)
The co-maximal subgroup graph $\Gamma(G)$ of a group $G$ is a graph whose vertices are non-trivial proper subgroups of $G$ and two vertices $H$ and $K$ are adjacent if $HK = G$. In this paper, we study and characterize various properties
Externí odkaz:
https://doaj.org/article/b05befaa0fa94f06a5ad853d4e4d910a
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 42, Iss 2, Pp 501-534 (2022)
We consider digraph colouring games where two players, Alice and Bob, alternately colour vertices of a given digraph D with a colour from a given colour set in a feasible way. The game ends when such move is not possible any more. Alice wins if every
Externí odkaz:
https://doaj.org/article/8ad5b3b48dc341faa63d196446eec080
Publikováno v:
Open Mathematics, Vol 20, Iss 1, Pp 16-23 (2022)
In this paper, we establish sufficient and necessary conditions for the existence of abelian subgroups of maximal order of a finite group GG, by means of its commuting graph. The order of these subgroups attains the bound c=∣[x1]∣+⋯+∣[xm]∣c
Externí odkaz:
https://doaj.org/article/7809dc4a81e84206ab28927a3e737d4b
Publikováno v:
AIMS Mathematics, Vol 7, Iss 2, Pp 2634-2645 (2022)
Let $ G_1 \square G_2 $ be the Cartesian product of simple, connected and finite graphs $ G_1 $ and $ G_2 $. We give necessary and sufficient conditions for the Cartesian product of graphs to be very strongly perfect. Further, we introduce and charac
Externí odkaz:
https://doaj.org/article/648fe1e102aa4dabbb6715d7d3c47dbc
Autor:
Jessie Hamm, Alan Way
Publikováno v:
International Journal of Group Theory, Vol 10, Iss 3, Pp 137-147 (2021)
There are many different graphs one can associate to a group. Some examples are the well-known Cayley graph, the zero divisor graph (of a ring), the power graph, and the recently introduced coprime graph of a group. T
Externí odkaz:
https://doaj.org/article/09b3b86cf2424deabe7e45c7a5bde4e9