Results 131 to 140 of about 59,275 (246)
Some Variations of Perfect Graphs
Discussiones Mathematicae Graph Theory, 2016 We consider (ψk−γk−1)-perfect graphs, i.e., graphs G for which ψk(H) = γk−1(H) for any induced subgraph H of G, where ψk and γk−1 are the k-path vertex cover number and the distance (k − 1)-domination number, respectively.
Dettlaff Magda +3 more
doaj +1 more source
An Algorithm for Finding Large Induced Planar Subgraphs [PDF]
, 2002 Keith Edwards, Graham Farr
openalex +1 more source
On Endomorphism Universality of Sparse Graph Classes
Journal of Graph Theory, Volume 110, Issue 2, Page 223-244, October 2025.ABSTRACT We show that every commutative idempotent monoid (a.k.a. lattice) is the endomorphism monoid of a subcubic graph. This solves a problem of Babai and Pultr and the degree bound is best‐possible. On the other hand, we show that no class excluding a minor can have all commutative idempotent monoids among its endomorphism monoids. As a by‐product,
Kolja Knauer, Gil Puig i Surroca
wiley +1 more source
A relative bound for independence
, 2019 We prove an upper bound for the independence number of a graph in terms of the largest Laplacian eigenvalue, and of a certain induced subgraph. Our bound is a refinement of a well-known Hoffman-type bound.Comment: 10 pages; preprint, comments are ...
Nica, Bogdan
core
A Dichotomy Theorem for Γ‐Switchable H‐Colouring on m‐Edge‐Coloured Graphs
Journal of Graph Theory, Volume 110, Issue 2, Page 200-208, October 2025.ABSTRACT Let G be a graph in which each edge is assigned one of the colours 1 , 2 , … , m, and let Γ be a subgroup of S m. The operation of switching at a vertex x of G with respect to an element π of Γ permutes the colours of the edges incident with x according to π.
Richard Brewster +2 more
wiley +1 more source
SEGCN: a subgraph encoding based graph convolutional network model for social bot detection
Scientific ReportsMessage passing neural networks such as graph convolutional networks (GCN) can jointly consider various types of features for social bot detection. However, the expressive power of GCN is upper-bounded by the 1st-order Weisfeiler–Leman isomorphism test ...
Feng Liu +5 more
doaj +1 more source
Zero-sum partition theorems for graphs
International Journal of Mathematics and Mathematical Sciences, 1994 Let q=pn be a power of an odd prime p. We show that the vertices of every graph G can be partitioned into t(q) classes V(G)=⋃t=1t(q)Vi such that the number of edges in any induced subgraph 〈Vi〉 is divisible by q, where t(q)≤32(q−1)−(2(q−1)−1)124+98, and ...
Y. Caro, I. Krasikov, Y. Roditty
doaj +1 more source
On Covering a Graph Optimally with Induced Subgraphs
, 2006 We consider the problem of covering a graph with a given number of induced subgraphs so that the maximum number of vertices in each subgraph is minimized.
Thite, Shripad
core +1 more source
Abundant Neighborhoods, Two‐Sided Markets, and Maximal Matchings
Naval Research Logistics (NRL), Volume 72, Issue 7, Page 1022-1035, October 2025.ABSTRACT I introduce a new graph‐theoretic property called abundant neighborhoods. This property is motivated by studying the thickness of economic markets. A vertex is, roughly, guaranteed to match if and only if it has an abundant neighborhood.
Muhammad Maaz
wiley +1 more source
Cyclomatic numbers of connected induced subgraphs
Discrete Mathematics, 1992 For a graph \(G=\bigl( V(G),E(G) \bigr)\), the cyclomatic number \(cy(G)\) is defined by \(cy(G)=| E(G) |-| V(G) |+1\). Let \(A\) be an independent set of vertices of \(G\) and let \(C(A)\) be the collection of all connected induced subgraphs of \(G\) which contain \(A\). Define \(\omega(A)=\min \bigl\{ cy(H):H \in C(A) \bigr\}\).
openaire +3 more sources