Results 31 to 40 of about 43,364 (297)
The Forcing Domination Number of Hamiltonian Cubic Graphs [PDF]
, 2009 The authors presented a sequence of Hamiltonian cubic graphs whose domination numbers are sharp and in this paper we study forcing domination number for those ...
H. Abdollahzadeh Ahangar +3 more
core +1 more source
The Windy Postman Problem on Series-Parallel Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 The windy postman problem is the NP-hard problem of finding the minimum cost of a tour traversing all edges of an undirected graph, where the cost of traversal of an edge depends on the direction. Given an undirected graph $G$, we consider the polyhedron
Francisco Javier Zaragoza Martínez
doaj +1 more source
Testing hereditary properties of nonexpanding bounded-degree graphs [PDF]
, 2007 We study graph properties that are testable for bounded-degree graphs in time independent of the input size. Our goal is to distinguish between graphs having a predetermined graph property and graphs that are far from every graph having that property. It
Christian Sohler +5 more
core +1 more source
Perfect matching transitivity of circulant graphs.
Electronic Journal of Graph Theory and Applications, 2022 A graph G is perfect matching transitive, shortly PM-transitive, if for any two perfect matchings M1 and M2 of G, there is an automorphism f : V(G)↦V(G) such that fe(M1)=M2, where fe(uv)=f(u)f(v).
Isaac Armando Reiter, Ju Zhou
doaj +1 more source
Defective Coloring on Classes of Perfect Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2022 In Defective Coloring we are given a graph $G$ and two integers $\chi_d$, $\Delta^*$ and are asked if we can $\chi_d$-color $G$ so that the maximum degree induced by any color class is at most $\Delta^*$.
Rémy Belmonte +2 more
doaj +1 more source
Nearly perfect sets in the n-fold products of graphs [PDF]
Opuscula Mathematica, 2007 The study of nearly perfect sets in graphs was initiated in [J. E. Dunbar, F. C. Harris, S. M. Hedetniemi, S. T. Hedetniemi, A. A. McRae, R. C. Laskar, Nearly perfect sets in graphs, Discrete Mathematics 138 (1995), 229-246]. Let \(S \subseteq V(G)\). We
Monika Perl
doaj
Perfect edge domination in vague graphs
Ratio Mathematica, 2021 In this paper, we modified undirected vague graphs and edge domination set based on these two concepts. We study the notions of perfect edge domination, connected perfect edge domination of vague graph. Moreover, we investigate some related properties in
M Kaliraja, P Kanibose, Abdul Ibrahim
doaj +1 more source
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
Characterising and recognising game-perfect graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 Consider a vertex colouring game played on a simple graph with $k$ permissible colours. Two players, a maker and a breaker, take turns to colour an uncoloured vertex such that adjacent vertices receive different colours.
Dominique Andres, Edwin Lock
doaj +1 more source
Electronic Notes in Discrete Mathematics, 2013 Abstract In this paper we study a natural generalization for the perfection of graphs to other interesting parameters related with colorations. This generalization was introduced partially by Christen and Selkow in 1979 and Yegnanarayanan in 2001. Let a , b ∈ { ω , χ , Γ , α , ψ } where ω is the clique number, χ is the chromatic ...
Gabriela Araujo-Pardo +1 more
openaire +1 more source