Results 81 to 90 of about 783,181 (348)
Uniquely colorable perfect graphs [PDF]
, 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
Perfect Roman and Perfect Italian Domination of Cartesian Product Graphs
Scientific Journal of King Faisal University: Basic and Applied SciencesFor a graph G=(V,E), a function f:V→{0,1,2} is a perfect Roman dominating function (PRDF) on G if every v∈V with f(v)=0 is adjacent to exactly one vertex u with f(u)=2. The sum ∑_(v∈V)^▒f (v) is the weight w(f) of f.
Ahlam Almulhim
doaj +1 more source
Advanced Functional Materials, EarlyView.Hydrophilic PEO‐copolymers and hydrophobic PDMS are physically integrated via a compatibilizing solvent into an amphipathic dual‐polymer network with versatile interfacial affinity and completely amorphized PEO segments for hyper‐permeable CO2 transport.
Ji Wu +9 more
wiley +1 more source
Claw-free circular-perfect graphs [PDF]
, 2010 International audienceThe circular chromatic number of a graph is a well-studied refinement of the chromatic number. Circular-perfect graphs form a superclass of perfect graphs defined by means of this more general coloring concept.
Pêcher, Arnaud +3 more
core +1 more source
, 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 +2 more sources
Integral sum graphs Gn and G-r,n are perfect graphs
AKCE International Journal of Graphs and CombinatoricsA graph G is an integral sum graph (sum graph) if its vertices can be labeled with distinct integers (positive integers) so that e = uv is an edge of G if and only if the sum of the labels on vertices u and v is also a label in G. A graph G is perfect if
Julia K. Abraham +4 more
doaj +1 more source
Rainbow perfect domination in lattice graphs
Electronic Journal of Graph Theory and Applications, 2018 Let 0 < n ∈ Z. In the unit distance graph of Zn ⊂ Rn, a perfect dominating set is understood as having induced components not necessarily trivial.
Luis R. Fuentes +2 more
doaj +1 more source
A New Bioactive Glass‐Based Hybrid Bioink With Enhanced Cell Viability and Antibacterial Properties
Advanced Healthcare Materials, EarlyView.Graphical illustration of the production and characterization process, demonstrating the multiple functions of the new hybrid gelatin methacryloyl‐silver‐bioactive glass (GAB) material. Created in https://BioRender.com. ABSTRACT Recent advances in three‐dimensional bioprinting (3DBP) technology enable the production of customized bone substitutes ...
Adam C. Marsh +14 more
wiley +1 more source
Maximal outerplanar graphs as chordal graphs, path-neighborhood graphs, and triangle graphs [PDF]
Maximal outerplanar graphs are characterized using three different classes of graphs. A path-neighborhood graph is a connected graph in which every neighborhood induces a path. The triangle graph $T(G)$ has the triangles of the graph $G$ as its vertices,
Novick, B., Laskar, R.C., Mulder, H.M.
core
Compositions for perfect graphs
Discrete Mathematics, 1985 In this paper we introduce a new graph composition, called 2-amalgam, and we prove that the 2-amalgam of perfect graphs is perfect. This composition generalizes many of the operations known to preserve perfection, such as the clique identification, substitution, join and amalgam operations.
Gérard Cornuéjols +1 more
openaire +2 more sources