Results 101 to 110 of about 43,364 (297)
, 1996 A perfect graph is critical if the deletion of any edge results in an imperfect graph. We give examples of such graphs and prove some basic properties. We relate critically perfect graphs to wellknown classes of perfect graphs, investigate the structure ...
Annegret Wagler
core +1 more source
k-perfect geodominating sets in graphs [PDF]
Opuscula Mathematica, 2007 A perfect geodominating set in a graph \(G\) is a geodominating set \(S\) such that any vertex \(v \in V(G)\setminus S\) is geodominated by exactly one pair of vertices of \(S\).
Doost Ali Mojdeh, Nader Jafari Rad
doaj
Perfect Graphs, Partitionable Graphs and Cutsets
Combinatorica, 2002 We prove a theorem about cutsets in partitionable graphs that generalizes earlier results on amalgams, 2-amalgams and homogeneous pairs.
CONFORTI, MICHELANGELO +3 more
openaire +2 more sources
Uniquely colorable perfect graphs
, 1983 This paper defines the concept of sequential coloring. If G or its complement is one of four major types of perfect graphs, G is shown to be uniquely k-colorable it and only if it is sequentially k-colorable.
Tucker, Alan
core +1 more source
Advanced Robotics Research, EarlyView.This study explores how information processing is distributed between brains and bodies through a codesign approach. Using the “backpropagation through soft body” framework, brain–body coupling agents are developed and analyzed across several tasks in which output is generated through the agents’ physical dynamics.
Hiroki Tomioka +3 more
wiley +1 more source
Perfect Roman Domination: Aspects of Enumeration and Parameterization
AlgorithmsPerfect Roman Dominating Functions and Unique Response Roman Dominating Functions are two ways to translate perfect code into the framework of Roman Dominating Functions.
Kevin Mann, Henning Fernau
doaj +1 more source
Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly [PDF]
Discrete Mathematics & Theoretical Computer ScienceThe Grundy number of a graph is the maximum number of colours used by the "First-Fit" greedy colouring algorithm over all vertex orderings. Given a vertex ordering $\sigma= v_1,\dots,v_n$, the "First-Fit" greedy colouring algorithm ...
Laurent Beaudou +6 more
doaj +1 more source
Advanced Robotics Research, EarlyView.An enhanced universal gripper combining rigid mechanics with self‐adaptable fingers is presented for industrial automation. The novel six‐bar linkage with integrated compliant pad eliminates mechanical interference while enabling passive shape adaptation.
Muhammad Usman Khalid +7 more
wiley +1 more source
Representation of competitions by generalized fuzzy graphs
International Journal of Computational Intelligence Systems, 2018 Generalized fuzzy graphs are perfect to represent any system like networks, images, scheduling, etc. compared to fuzzy graphs. This study introduces the concept of a generalized fuzzy neighbourhood of a vertex and generalized fuzzy graphs.
Sovan Samanta, Biswajit Sarkar
doaj +1 more source
Distance perfectness of graphs
Discussiones Mathematicae Graph Theory, 1999 The author introduces a new generalization of perfect graphs. It turns out that the analogue of the weak perfect graph theorem is not true for this generalization. A subset \(Q\) of the vertex set \(V\) of a graph \(G\) is a \(k\)-distance clique in \(G\) if \(d_G(x,y)\leq k\) for any \(x,y\in Q\) and \(\langle Q\rangle_G\), the subgraph of \(G ...
openaire +1 more source