Results 41 to 50 of about 1,679,013 (321)
Perfect codes in power graphs of finite groups
Open Mathematics, 2017 The power graph of a finite group is the graph whose vertex set is the group, two distinct elements being adjacent if one is a power of the other. The enhanced power graph of a finite group is the graph whose vertex set consists of all elements of the ...
Ma Xuanlong +4 more
doaj +1 more source
Forbidden Structures for Planar Perfect Consecutively Colourable Graphs
Discussiones Mathematicae Graph Theory, 2017 A consecutive colouring of a graph is a proper edge colouring with posi- tive integers in which the colours of edges incident with each vertex form an interval of integers.
Borowiecka-Olszewska Marta +1 more
doaj +1 more source
Perfect 2‐colorings of Hamming graphs [PDF]
Journal of combinatorial designs (Print), 2019 We consider the problem of existence of perfect 2‐colorings (equitable 2‐partitions) of Hamming graphs with given parameters. We start with conditions on parameters of graphs and colorings that are necessary for their existence.
E. Bespalov +4 more
semanticscholar +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 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
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
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
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
Cyclotomic graphs and perfect codes
, 2018 We study two families of cyclotomic graphs and perfect codes in them. They are Cayley graphs on the additive group of $\mathbb{Z}[\zeta_m]/A$, with connection sets $\{\pm (\zeta_m^i + A): 0 \le i \le m-1\}$ and $\{\pm (\zeta_m^i + A): 0 \le i \le \phi(m)
Zhou, Sanming
core +1 more source