Results 41 to 50 of about 520,977 (330)
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
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
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 +4 more
doaj +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
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
FEBS Open Bio, EarlyView.This study addressed how a senior research thesis is perceived by undergraduate students. It assessed students' perception of research skills, epistemological beliefs, and career goals in Biochemistry (science) and BDC (science‐business) students. Completing a thesis improved confidence in research skills, resilience, scientific identity, closed gender‐
Celeste Suart +4 more
wiley +1 more source
Even cycles and perfect matchings in claw-free plane graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 Lov{\'a}sz showed that a matching covered graph $G$ has an ear decomposition starting with an arbitrary edge of $G$. Let $G$ be a graph which has a perfect matching.
Shanshan Zhang +2 more
doaj +1 more source
Perfect state transfer, graph products and equitable partitions [PDF]
, 2010 We describe new constructions of graphs which exhibit perfect state transfer on continuous-time quantum walks. Our constructions are based on variants of the double cones [BCMS09,ANOPRT10,ANOPRT09] and the Cartesian graph products (which includes the n ...
Ge, Yang +3 more
core