Results 21 to 30 of about 973,826 (351)
Commuting decomposition of Kn1,n2,...,nk through realization of the product A(G)A(GPk )
Special Matrices, 2018 In this paper, we introduce the notion of perfect matching property for a k-partition of vertex set of given graph. We consider nontrivial graphs G and GPk , the k-complement of graph G with respect to a kpartition of V(G), to prove that A(G)A(GPk ) is ...
Bhat K. Arathi, Sudhakara G.
doaj +1 more source
Fractional matching preclusion for butterfly derived networks
Theory and Applications of Graphs, 2019 The matching preclusion number of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost perfect matchings.
Xia Wang +4 more
doaj +1 more source
On the number of perfect matchings in random polygonal chains
Open Mathematics, 2023 Let GG be a graph. A perfect matching of GG is a regular spanning subgraph of degree one. Enumeration of perfect matchings of a (molecule) graph is interest in chemistry, physics, and mathematics.
Wei Shouliu +3 more
doaj +1 more source
Graph products of groups [PDF]
, 1990 In the 1970's Baudisch introduced the idea of the semifree group, that is, a group in which the only relators are commutators of generators. Baudisch was mainly concerned with subgroup problems, employing length arguments on the elements of these groups.
Green, E.R, Green, Elisabeth Ruth
core +7 more sources
On kernels in strongly game-perfect digraphs and a characterisation of weakly game-perfect digraphs
AKCE International Journal of Graphs and Combinatorics, 2020 We prove that the game-perfect digraphs defined by Andres (2012) with regard to a digraph version of the maker-breaker graph colouring game introduced by Bodlaender (1991) always have a kernel.
Stephan Dominique Andres
doaj +1 more source
Formation of Non-Perfect Maze Using Prim’s Algorithm
JTAM (Jurnal Teori dan Aplikasi Matematika), 2023 Maze is a place that has many paths with tortuous paths that are misleading and full of dead ends and can be viewed as a grid graph. A non-perfect maze is a maze that has a cycle.
Mahyus Ihsan +4 more
doaj +1 more source
, 1994 Suatu graph G, diambil jumlah titik dari clique maksimal sebagai dasar dalam pewarnaan titik-titik pada graph tersebut. Banyaknya warna paling sedikit yang digunakan untuk 3Dewarnaan tersebut dibandingkan dengan jumlah titik dari clique maksimal.
Mulyani , Sri
core +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
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 and Imperfect Duty: Unpacking Kant's Complex Distinction [PDF]
, 2023 I attempt first to disentangle three aspects of Kant’s distinction between perfect and imperfect duty. There is the central distinction between principles of duty contrary to that which is contradictory in conception/consistent in conception but ...
Hope, Simon James
core +1 more source