Results 51 to 60 of about 505,548 (331)
On perfectness of sums of graphs
Discrete Mathematics, 1999 The sum (also known as Cartesian product) \(G+H\) of two graphs \(G= (X,U)\) and \(H= (Y,V)\) has vertex set \(Z= \{(x,y)\mid x\in X, y\in Y\}\) and edge set \(W= \{[(x,y),(x',y')]\mid x= x',[y,y']\in V\) or \(y= y'\), \([x,x']\in U\}\). The authors motivate the study of the characterization of perfect sum graphs through the result that a graph \(G ...
Alain Hertz, D. de Werra
openaire +3 more sources
Faster exponential-time algorithms in graphs of bounded average degree [PDF]
, 2013 We first show that the Traveling Salesman Problem in an n-vertex graph with average degree bounded by d can be solved in O*(2^{(1-\eps_d)n}) time and exponential space for a constant \eps_d depending only on d, where the O*-notation suppresses factors ...
A. Björklund +6 more
core +2 more sources
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
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
The first order convergence law fails for random perfect graphs [PDF]
, 2018 We consider first order expressible properties of random perfect graphs. That is, we pick a graph $G_n$ uniformly at random from all (labelled) perfect graphs on $n$ vertices and consider the probability that it satisfies some graph property that can be ...
Bender +10 more
core +2 more sources
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
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
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
Discrete Mathematics, 1977 AbstractIn this paper perfectness of various products of graphs is considered. The Cartesian product G1 × G2 is perfect iff it has no induced C2n+1 (n ⩾ 2). By considering the various sufficient conditions for the latter condition, perfect Cartesian products are characterized. Similarly perfect tensor products G1 × G2 are characterized and it is proved
G. Ravindra, K. R. Parthasarathy
openaire +3 more sources
International Journal of Adaptive Control and Signal Processing, EarlyView.Workflow of the parameter optimization process for ITSC fault detection, applying Differential Evolution optimization and the Smooth Pseudo Wigner‐Ville Distribution for signal processing. The optimized parameters are then used in the failure identification pipeline, which combines the signal processing with a YOLO‐based architecture for fault severity
Rafael Martini Silva +4 more
wiley +1 more source