A5023472150- Advanced Graph Theory Research
- Graph Labeling and Dimension Problems
- graph theory and CDMA systems
- Graph theory and applications
- Limits and Structures in Graph Theory
- Complexity and Algorithms in Graphs
- Interconnection Networks and Systems
- Coding theory and cryptography
- Complex Network Analysis Techniques
- Opinion Dynamics and Social Influence
- Acute Myeloid Leukemia Research
- Point processes and geometric inequalities
- Mathematics and Applications
- Acute Lymphoblastic Leukemia research
- Advanced Topics in Algebra
- Social and Economic Solidarity
- Optimization and Search Problems
- Advanced Optimization Algorithms Research
- Geography and Environmental Studies
- Optimization and Variational Analysis
- Data Management and Algorithms
- Game Theory and Applications
- Interstitial Lung Diseases and Idiopathic Pulmonary Fibrosis
- Chronic Myeloid Leukemia Treatments
- Finite Group Theory Research
Universidade Federal de Goiás
2014-2024
Universidade Federal do Rio de Janeiro
2011
Let $G$ be a finite, simple, and undirected graph let $S$ set of vertices $G$. If no vertex that does not belong to has two neighbors in $S$, then is $P_3$-convex. The $P_3$-convex hull $H_G(S)$ the smallest containing $S$. $P_3$-Carathéodory number integer $c$ such for every $u$ $H_G(S)$, there $F\subseteq S$ with $|F|\leq c$ $u\in H_G(F)$. We study structural algorithmic aspects number. characterize trees block graphs, establish upper bounds on general graphs claw-free prove it NP-complete...
If S is a set of vertices graph G, then the convex hull in P 3-convexity G smallest H (S) that contains such no vertex V (G) has at least two neighbors S. The Caratheodory number 3 convexity integer c for every and u (S), there F ⊆ with ¦F¦ ≤ ∈ (F). We describe polynomial time algorithm to determine chordal graph.
In the geodetic convexity, a set of vertices S graph G is convex if all belonging to any shortest path between two lie in . The hull H ( ) smallest containing If = V ), then cardinality h minimum number complementary prism GḠ arises from disjoint union and Ḡ by adding edges perfect matching corresponding A autoconnected both are connected. Motivated previous work, we study for prisms graphs. When split graph, present lower upper bounds showing that unlimited. other case, when non-split it...
In the geodetic convexity, a set of vertices $S$ graph $G$ is $\textit{convex}$ if all belonging to any shortest path between two lie in $S$. The cardinality $con(G)$ maximum proper convex $\textit{convexity number}$ $G$. $\textit{complementary prism}$ $G\overline{G}$ arises from disjoint union and $\overline{G}$ by adding edges perfect matching corresponding $\overline{G}$. this work, we prove that decision problem related convexity number NP-complete even restricted complementary prisms,...
Let $G$ be a finite, simple, and undirected graph let $S$ set of vertices $G$. In the geodetic convexity, is convex if all belonging to any shortest path between two lie in $S$. The hull $H(S)$ smallest containing If $H(S) = V(G)$, then set. cardinality $h(G)$ minimum number complementary prism $G\overline{G}$ arises from disjoint union $\overline{G}$ by adding edges perfect matching corresponding $\overline{G}$. Motivated previous work, we determine present lower upper bounds on prisms...
Let G ⃗ = ( V, A ) be an oriented graph and the underlying of ⃗. An k -coloring is a partition V into color classes, such that there no pair adjacent vertices belonging to same class all arcs between classes have orientation. The smallest admits chromatic number χ o ⃗) undirected maximum for orientations . Oriented product two graphs 1 , 2 was widely studied, but disjoint union ∪ has not yet been considered. In this article we proved bounds any also given complete K n m with ≥ real α ∈ (1,...
For a positive integer k , subset S of vertices graph G is -independent if each vertex in has at most − 1 neighbors . We consider sets two products: Cartesian and complementary prism. show that the problem determining -independence remains NP-complete even for products prisms. Furthermore, we present results on product paths, known as grid graphs.
Para um grafo G = (V (G), E(G)), conjunto S ⊆ V (G) é dominante independente aberto, ou OIND, se para todo v ∈ S, temos que |N(v) ∩ S| ≤ 1, e |N [v] ≥ 1. A cardinalidade mínima do OIND de denotada por γoind(G). Neste trabalho mostramos alguns resultados γoind(G) em classes simples grafos e, dado o produto lexicográfico dois H, denotado ◦ nós limites γoind(G H).
For a finite, simple, undirected graph G = (V (G),E(G)), an open-dominating set S ⊆ V (G) is such that every vertex in has at least one neighbor S. An open-independent, open-locating-dominating (OLDOIND-set for short) no two vertices have the same of neighbors and each open-dominated exactly once by The problem deciding whether or not given OLDOIND-set known to be NP-complete. complementary prism GG‾, formed from disjoint union its complement G‾ adding edges perfect matching between...
Let G be a finite, simple, undirected graph with vertex set V (G). If there is subset S ⊆ (G), and every of (G) at least two neighbors in also member S, then termed P3-convex. The P3-convex hull the smallest convex containing S. P3-hull number h(G) cardinality vertices whose entire graph. In this paper we establish some bounds on graphs diameter two. Particularly, biconnected C6-free most 4. We upper bound h(G)≤⌈k1+b⌉+1 or alternatively h(G)≤⌈logc+1(k.c+1)⌉+1, for strongly regular G(n,k,b,c).
We show that an identifying code of minimum order in the complementary prism a cycle n has 7n/9 + Θ(1). Furthermore, we observe clique-width graph k is at most 4k, and discuss some algorithmic consequences.