Results 61 to 70 of about 215 (116)
Partial product of graphs and Vizing's conjecture
Ars Mathematica Contemporanea, 2014 Let G and H be two graphs with vertex sets V 1 = { u 1 , . . . , u n 1 } and V 2 = { v 1 , . . . , v n 2 } , respectively. If S ⊂ V 2 , then the partial Cartesian product of G and H with respect to S is the graph G □ S H = ( V , E ) , where V = V 1 × V 2 and two vertices ( u i , v j
openaire +3 more sources
Discrete Mathematics, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Luo, Rong, Zhao, Yue
openaire +3 more sources
Vizing's 2-Factor Conjecture Involving Toughness and Maximum Degree Conditions
The Electronic Journal of Combinatorics, 2019 Let $G$ be a simple graph, and let $\Delta(G)$ and $\chi'(G)$ denote the maximum degree and chromatic index of $G$, respectively. Vizing proved that $\chi'(G)=\Delta(G)$ or $\chi'(G)=\Delta(G)+1$. We say $G$ is $\Delta$-critical if $\chi'(G)=\Delta(G)+1$ and $\chi'(H)<\chi'(G)$ for every proper subgraph $H$ of $G$.
Kanno, Jinko, Shan, Songling
openaire +4 more sources
Personality and Mental Health, Volume 19, Issue 2, May 2025.ABSTRACT Antisocial Personality Disorder (ASPD) is a personality disorder that entails significant impairments and/or costs at the individual, interpersonal, and community levels. Given its clinical relevance, scientific research is placing a significant focus on the study of the central characteristics of this condition to guide prevention and ...
Alessio Gori +2 more
wiley +1 more source
Parameters related to fractional domination in graphs. [PDF]
, 1995 Thesis (M.Sc.)-University of Natal, 1995.The use of characteristic functions to represent well-known sets in graph theory such as dominating, irredundant, independent, covering and packing sets - leads naturally to fractional versions of these sets and ...
Erwin, D. J.
core
Essentially tight bounds for rainbow cycles in proper edge‐colourings
Proceedings of the London Mathematical Society, Volume 130, Issue 4, April 2025.Abstract An edge‐coloured graph is said to be rainbow if no colour appears more than once. Extremal problems involving rainbow objects have been a focus of much research over the last decade as they capture the essence of a number of interesting problems in a variety of areas.
Noga Alon +4 more
wiley +1 more source
, 2012 Catalog of undergrauate student research poster presentations with abstracts.https://digitalcommons.library.uab.edu/expo-p/1006/thumbnail ...
University of Alabama at Birmingham
core +1 more source
Central limit theorem in disordered Monomer‐Dimer model
Random Structures &Algorithms, Volume 66, Issue 1, January 2025.Abstract We consider the disordered monomer‐dimer model on general finite graphs with bounded degrees. Under the finite fourth moment assumption on the weight distributions, we prove a Gaussian central limit theorem for the free energy of the associated Gibbs measure with a rate of convergence. The central limit theorem continues to hold under a nearly
Wai‐Kit Lam, Arnab Sen
wiley +1 more source
European Journal of Neuroscience, Volume 61, Issue 2, January 2025.ABSTRACT The Dark Triad (DT), encompassing narcissism, Machiavellianism and psychopathy traits, poses significant societal challenges. Understanding the neural underpinnings of these traits is crucial for developing effective interventions and preventive strategies. Our study aimed to unveil the neural substrates of the DT by examining brain scans from
Richard Bakiaj +3 more
wiley +1 more source
Proof of the Goldberg-Seymour Conjecture on Edge-Colorings of Multigraphs
, 2019 Given a multigraph $G=(V,E)$, the {\em edge-coloring problem} (ECP) is to color the edges of $G$ with the minimum number of colors so that no two adjacent edges have the same color.
Chen, Guantao +2 more
core