Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Ludwin A. Basilio has a total of 8 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    General Properties on Differential Sets of a Graph

    by Ludwin A. Basilio, Sergio Bermudo, Juan C. Hernández-Gómez, José M. Sigarreta

    Let G=(V,E) be a graph, and let β∈R. Motivated by a service coverage maximization problem with limited resources, we study the β-differential of G. The β-differential of G, denoted by ∂β(G), is defined as ∂β(G):=max{|B(S)|−β|S|suchthatS⊆V}. The case in which β=1 is known as the differential of G, and hence ∂β(G) can be considered as a generalization of the differential ∂(G) of G. In this paper, upper and lower bounds for ∂β(G) are given in terms of its order |G|, minimum degree δ(G), maximum degree Δ(G), among other invariants of G. Likewise, the β-differential for graphs with heavy vertices is studied, extending the set of applications that this concept can have.


  • Open Access

    The Differential on Graph Operator Q(G)

    by Ludwin A. Basilio, Jair Castro Simon, Jesús Leaños, Omar Rosario Cayetano

    If G = ( V ( G ) , E ( G ) ) is a simple connected graph with the vertex set V ( G ) and the edge set E ( G ) , S is a subset of V ( G ) , and let B ( S ) be the set of neighbors of S in V ( G ) ∖ S . Then, the differential of S ∂ ( S ) is defined as | B ( S ) | − | S | . The differential of G, denoted by ∂ ( G ) , is the maximum value of ∂ ( S ) for all subsets S ⊆ V ( G ) . The graph operator Q ( G ) is defined as the graph that results by subdividing every edge of G once and joining pairs of these new vertices iff their corresponding edges are incident in G. In this paper, we study the relations between ∂ ( G ) and ∂ ( Q ( G ) ) . Besides, we exhibit some results relating the differential ∂ ( G ) and well-known graph invariants, such as the domination number, the independence number, and the vertex-cover number.


  • On the Differential Polynomial of a Graph

    by Ludwin A. Basilio-Hernández, Walter Carballosa, Jesús Leaños, José M. Sigarreta


  • Open Access

    β-Differential of a Graph

    by Ludwin A. Basilio, Sergio Bermudo, Jesús Leaños, José M. Sigarreta

    Let G = ( V , E ) be a simple graph with vertex set V and edge set E. Let D be a subset of V, and let B ( D ) be the set of neighbours of D in V ∖ D . The differential ∂ ( D ) of D is defined as | B ( D ) | − | D | . The maximum value of ∂ ( D ) taken over all subsets D ⊆ V is the differential ∂ ( G ) of G. For β ∈ ( − 1 , Δ ) , the β-differential ∂ β ( G ) of G is the maximum value of { | B ( D ) | − β | D | : D ⊆ V } . Motivated by an influential maximization problem, in this paper we study the β -differential of G.