Results 51 to 60 of about 64,086 (307)
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
Electronic Notes in Discrete Mathematics, 2013 Abstract In this paper we study a natural generalization for the perfection of graphs to other interesting parameters related with colorations. This generalization was introduced partially by Christen and Selkow in 1979 and Yegnanarayanan in 2001. Let a , b ∈ { ω , χ , Γ , α , ψ } where ω is the clique number, χ is the chromatic ...
Gabriela Araujo-Pardo +1 more
openaire +1 more source
A STUDY ON PERFECT ITALIAN DOMINATION OF GRAPHS AND THEIR COMPLEMENTS
Ural Mathematical JournalPerfect 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 +1 more
doaj +1 more source
Electronic Notes in Discrete Mathematics, 1999 Two graphs \(G\) and \(H\) on the vertex set \(V\) are \(P_4\)-isomorphic if there is a permutation \(\pi\) on \(V\) such that, for all subsets \(S\) of \(V\), \(S\) induces a chordless \(P_4\) in \(G\) if and only if \(\pi (S)\) induces a \(P_4\) in \(H\). The author characterizes all graphs \(P_4\)-isomorphic to a bipartite graph. For example, we can
openaire +1 more source
Existence of perfect matchings in a plane bipartite graph [PDF]
, 1996 summary:We give a necessary and sufficient condition for the existence of perfect matchings in a plane bipartite graph in terms of elementary edge-cut, which extends the result for the existence of perfect matchings in a hexagonal system given in the ...
Che, Zhongyuan, Kochol, Martin
core +1 more source
Single‐molecule DNA flow‐stretch assays for high‐throughput DNA–protein interaction studies
FEBS Open Bio, EarlyView.We describe an optimised single‐molecule DNA flow‐stretch assay that visualises DNA–protein interactions in real time. Linear DNA fragments are tethered to a surface and stretched by buffer flow for fluorescence imaging. Using λ and φX174 DNA, this protocol enhances reproducibility and accessibility, providing a versatile approach for studying diverse ...
Ayush Kumar Ganguli +8 more
wiley +1 more source
Discussiones Mathematicae Graph Theory, 2013 Given a graph G = (V,E) and a set Lv of admissible colors for each vertex v ∈ V (termed the list at v), a list coloring of G is a (proper) vertex coloring ϕ : V → S v2V Lv such that ϕ(v) ∈ Lv for all v ∈ V and ϕ(u) 6= ϕ(v) for all uv ∈ E. If such a ϕ exists, G is said to be list colorable.
openaire +2 more sources
YIPFα1A expression is regulated by multilayered molecular mechanisms
FEBS Open Bio, EarlyView.YIPFα1A, a five‐pass Golgi protein, is regulated at multiple layers. (1) Rare‐codon enrichment drives translation‐coupled mRNA decay. (2) A proximal 3′‐UTR element stabilizes mRNA. (3) A distal 3′‐UTR element included by alternate poly(A) site usage represses translation, which can be overridden by the proximal 3′‐UTR element.
Tokio Takaji +2 more
wiley +1 more source
Conditional Strong Matching Preclusion of the Alternating Group Graph
Theory and Applications of Graphs, 2019 The strong matching preclusion number of a graph is the minimum number of vertices and edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings.
Mohamad Adballah, Eddie Cheng
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