scholarly journals Discrete Math with Programming

2021 ◽  
Author(s):  
Yanhong A. Liu ◽  
Matthew Castellana
Keyword(s):  
Discrete Math

scholarly journals On the star forest polytope for trees and cycles

2019 ◽  
Vol 53 (5) ◽  
pp. 1763-1773
Author(s):  
Meziane Aider ◽  
Lamia Aoudia ◽  
Mourad Baïou ◽  
A. Ridha Mahjoub ◽  
Viet Hung Nguyen
Keyword(s):  
Undirected Graph ◽  
Dominating Set ◽  
Discrete Math ◽  
Complete Characterization ◽  
Facial Structure ◽  
Maximum Weight ◽  
Single Node ◽  
End Node ◽  
Vertex Disjoint

Let G = (V, E) be an undirected graph where the edges in E have non-negative weights. A star in G is either a single node of G or a subgraph of G where all the edges share one common end-node. A star forest is a collection of vertex-disjoint stars in G. The weight of a star forest is the sum of the weights of its edges. This paper deals with the problem of finding a Maximum Weight Spanning Star Forest (MWSFP) in G. This problem is NP-hard but can be solved in polynomial time when G is a cactus [Nguyen, Discrete Math. Algorithms App. 7 (2015) 1550018]. In this paper, we present a polyhedral investigation of the MWSFP. More precisely, we study the facial structure of the star forest polytope, denoted by SFP(G), which is the convex hull of the incidence vectors of the star forests of G. First, we prove several basic properties of SFP(G) and propose an integer programming formulation for MWSFP. Then, we give a class of facet-defining inequalities, called M-tree inequalities, for SFP(G). We show that for the case when G is a tree, the M-tree and the nonnegativity inequalities give a complete characterization of SFP(G). Finally, based on the description of the dominating set polytope on cycles given by Bouchakour et al. [Eur. J. Combin. 29 (2008) 652–661], we give a complete linear description of SFP(G) when G is a cycle.

scholarly journals A characterization of the weighted version of McEliece–Rodemich–Rumsey–Schrijver number based on convex quadratic programming

2015 ◽  
Vol 07 (04) ◽  
pp. 1550050
Author(s):  
Carlos J. Luz
Keyword(s):  
Quadratic Programming ◽  
Discrete Math ◽  
Convex Quadratic Programming ◽  
Stability Number ◽  
Weighted Version ◽  
Similar Characterization ◽  
Number Formula ◽  
Weighted Stability ◽  
Theta Number

For any graph [Formula: see text] Luz and Schrijver [A convex quadratic characterization of the Lovász theta number, SIAM J. Discrete Math. 19(2) (2005) 382–387] introduced a characterization of the Lovász number [Formula: see text] based on convex quadratic programming. A similar characterization is now established for the weighted version of the number [Formula: see text] independently introduced by McEliece, Rodemich, and Rumsey [The Lovász bound and some generalizations, J. Combin. Inform. Syst. Sci. 3 (1978) 134–152] and Schrijver [A Comparison of the Delsarte and Lovász bounds, IEEE Trans. Inform. Theory 25(4) (1979) 425–429]. Also, a class of graphs for which the weighted version of [Formula: see text] coincides with the weighted stability number is characterized.

scholarly journals The Ermakov equation: A commentary

2008 ◽  
Vol 2 (2) ◽  
pp. 146-157 ◽  
Author(s):  
P.G.L. Leach ◽  
S.K. Andriopoulos
Keyword(s):  
Nonlinear Systems ◽  
Differential Equations ◽  
Ordinary Differential Equations ◽  
English Translation ◽  
Singularity Theory ◽  
Discrete Math ◽  
Previous Article ◽  
Short History ◽  
History Of ◽  
Modern Context

We present a short history of the Ermakov equation with an emphasis on its discovery by thewest and the subsequent boost to research into invariants for nonlinear systems although recognizing some of the significant developments in the east. We present the modern context of the Ermakov equation in the algebraic and singularity theory of ordinary differential equations and applications to more divers fields. The reader is referred to the previous article (Appl. Anal. Discrete math., 2 (2008), 123-145) for an english translation of Ermakov's original paper.

Maximum total irregularity index of some families of graph with maximum degree n − 1

2021 ◽  
pp. 2250069
Author(s):  
Shamaila Yousaf ◽  
Akhlaq Ahmad Bhatti
Keyword(s):  
Maximum Degree ◽  
Discrete Math ◽  
Simple Approach ◽  
Unicyclic Graphs ◽  
Irregularity Index ◽  
Degree Of A Vertex ◽  
Tricyclic Graphs ◽  
Bicyclic Graphs ◽  
Appl Math

The total irregularity index of a graph [Formula: see text] is defined by Abdo et al. [H. Abdo, S. Brandt and D. Dimitrov, The total irregularity of a graph, Discrete Math. Theor. Comput. Sci. 16 (2014) 201–206] as [Formula: see text], where [Formula: see text] denotes the degree of a vertex [Formula: see text]. In 2014, You et al. [L. H. You, J. S. Yang and Z. F. You, The maximal total irregularity of unicyclic graphs, Ars Comb. 114 (2014) 153–160.] characterized the graph having maximum [Formula: see text] value among all elements of the class [Formula: see text] (Unicyclic graphs) and Zhou et al. [L. H. You, J. S. Yang, Y. X. Zhu and Z. F. You, The maximal total irregularity of bicyclic graphs, J. Appl. Math. 2014 (2014) 785084, http://dx.doi.org/10.1155/2014/785084 ] characterized the graph having maximum [Formula: see text] value among all elements of the class [Formula: see text] (Bicyclic graphs). In this paper, we characterize the aforementioned graphs with an alternative but comparatively simple approach. Also, we characterized the graphs having maximum [Formula: see text] value among the classes [Formula: see text] (Tricyclic graphs), [Formula: see text] (Tetracyclic graphs), [Formula: see text] (Pentacyclic graphs) and [Formula: see text] (Hexacyclic graphs).

Integrals Don’t Have Anything to Do with Discrete Math, Do They?

2011 ◽  
Vol 84 (2) ◽  
pp. 108-119
Author(s):  
P. Mark Kayll
Keyword(s):  
Discrete Math

Adjacent vertex distinguishing edge coloring of planar graphs without 3-cycles

2020 ◽  
Vol 12 (04) ◽  
pp. 2050035
Author(s):  
Danjun Huang ◽  
Xiaoxiu Zhang ◽  
Weifan Wang ◽  
Stephen Finbow
Keyword(s):  
Planar Graph ◽  
Planar Graphs ◽  
Edge Coloring ◽  
Discrete Math ◽  
Adjacent Vertex ◽  
Chromatic Index ◽  
Proper Edge Coloring ◽  
Minimum Number

The adjacent vertex distinguishing edge coloring of a graph [Formula: see text] is a proper edge coloring of [Formula: see text] such that the color sets of any pair of adjacent vertices are distinct. The minimum number of colors required for an adjacent vertex distinguishing edge coloring of [Formula: see text] is denoted by [Formula: see text]. It is observed that [Formula: see text] when [Formula: see text] contains two adjacent vertices of degree [Formula: see text]. In this paper, we prove that if [Formula: see text] is a planar graph without 3-cycles, then [Formula: see text]. Furthermore, we characterize the adjacent vertex distinguishing chromatic index for planar graphs of [Formula: see text] and without 3-cycles. This improves a result from [D. Huang, Z. Miao and W. Wang, Adjacent vertex distinguishing indices of planar graphs without 3-cycles, Discrete Math. 338 (2015) 139–148] that established [Formula: see text] for planar graphs without 3-cycles.

Sign in / Sign up

Export Citation Format

Share Document