Results 31 to 40 of about 38,756 (312)
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
Nearly perfect sets in products of graphs [PDF]
Opuscula Mathematica, 2004 The study of nearly perfect sets in graphs was initiated in [Dunbar J. E., Harris F. C., Hedetniemi S. M., Hedetniemi S. T., McRae A. A., Laskar R. C.: Nearly perfect sets in graphs. Discrete Mathematics 138 (1995), 229-246]. Let \(S\subseteq V(G)\).
Maria Kwaśnik, Monika Perl
doaj
The Hadwiger number, chordal graphs and -perfection
AKCE International Journal of Graphs and Combinatorics, 2017 A graph is chordal if every induced cycle has three vertices. The Hadwiger number is the order of the largest complete minor of a graph. We characterize the chordal graphs in terms of the Hadwiger number and we also characterize the families of graphs ...
Christian Rubio-Montiel
doaj +1 more source
On the chromatic number of (P_{5},windmill)-free graphs [PDF]
Opuscula Mathematica, 2017 In this paper we study the chromatic number of \((P_5, windmill)\)-free graphs. For integers \(r,p\geq 2\) the windmill graph \(W_{r+1}^p=K_1 \vee pK_r\) is the graph obtained by joining a single vertex (the center) to the vertices of \(p\) disjoint ...
Ingo Schiermeyer
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
Advanced Engineering Materials, EarlyView.This study reports the fabrication of trabecular bioactive glass scaffolds (composition “1d”: 46.1SiO2‐28.7CaO‐8.8MgO‐6.2P2O5‐5.7CaF2‐4.5Na2O wt%) through vat photopolymerization and the relevant results from mechanical testing and in vivo implantation procedures in rabbit femora, showing great promise for bone tissue engineering applications.
Dilshat Tulyaganov +8 more
wiley +1 more source
On the number of perfect matchings in random polygonal chains
Open Mathematics, 2023 Let GG be a graph. A perfect matching of GG is a regular spanning subgraph of degree one. Enumeration of perfect matchings of a (molecule) graph is interest in chemistry, physics, and mathematics.
Wei Shouliu +3 more
doaj +1 more source
On Another Class of Strongly Perfect Graphs
Mathematics, 2022 For a commutative ring R with unity, the associate ring graph, denoted by AG(R), is a simple graph with vertices as nonzero elements of R and two distinct vertices are adjacent if they are associates.
Neha Kansal +3 more
doaj +1 more source
A Workflow to Accelerate Microstructure‐Sensitive Fatigue Life Predictions
Advanced Engineering Materials, EarlyView.This study introduces a workflow to accelerate predictions of microstructure‐sensitive fatigue life. Results from frameworks with varying levels of simplification are benchmarked against published reference results. The analysis reveals a trade‐off between accuracy and model complexity, offering researchers a practical guide for selecting the optimal ...
Luca Loiodice +2 more
wiley +1 more source
Recognition of Unipolar and Generalised Split Graphs
Algorithms, 2015 A graph is unipolar if it can be partitioned into a clique and a disjoint union of cliques, and a graph is a generalised split graph if it or its complement is unipolar.
Colin McDiarmid, Nikola Yolov
doaj +1 more source