Inne Singgih

activity

20182024

most citedAntimagic orientations of graphs with large maximum degree

3 citations · 5 across the 5 of their papers we have counts for

collaborators

Showing math.COShow all

5 papers · 1 filter

math.CO2020

On the maximum diameter of $k$ -colorable graphs

Éva Czabarka, Inne Singgih, László A. Székely

Erdős, Pach, Pollack and Tuza [J. Combin. Theory, B 47, (1989), 279-285] conjectured that the diameter of a $K_{2 r}$ -free connected graph of order $n$ and minimum degree $δ \geq 2$ …

math.CO2019★ 3 cited

Antimagic orientations of graphs with large maximum degree

Donglei Yang, Joshua Carlson, Andrew Owens +5

Given a digraph $D$ with $m$ arcs, a bijection $τ : A (D) \to {1, 2, \dots, m}$ is an antimagic labeling of $D$ if no two vertices in $D$ have the same vertex-sum, where t…

math.CO2019

Some remarks on the midrange crossing constant

É. Czabarka, I. Singgih, L. A. Székely +1

We verify an upper bound of Pach and Tóth [Combinatorica 17(1997), 427-439, Discrete and Computational Geometry 36(2006), 527-552] on the midrange crossing constant. Details of the…

math.CO2018

DNA graph characterization for the line digraph of dicycle with $⌊ \frac{n}{3} ⌋$ chords, $\infty$ -digraph $C_{n} \cdot C_{p}$ , and 3-blade-propeller $C_{n} \cdot C_{p} \cdot C_{q}$

Inne Singgih

DNA graph has important contribution in completing the computational step of DNA sequencing process. Using $(α, k)$ -labeling, several families of digraphs have characterized as DNA…

math.CO2018★ 1 cited

Subtractive Magic and Antimagic Total Labeling for Basic Families of Graphs

Inne Singgih

A \textit{subtractive arc-magic labeling} (SAML) of a directed graph $G = (V, A)$ is a bijection $λ : V \cup A \to {1, 2, \dots, ∣ V ∣ + ∣ A ∣}$ with the property that for every $x y \in A$ we h…

On the maximum diameter of k-colorable graphs

Antimagic orientations of graphs with large maximum degree

Some remarks on the midrange crossing constant

DNA graph characterization for the line digraph of dicycle with ⌊3n​⌋ chords, ∞-digraph Cn​⋅Cp​, and 3-blade-propeller Cn​⋅Cp​⋅Cq​

Subtractive Magic and Antimagic Total Labeling for Basic Families of Graphs

On the maximum diameter of $k$ -colorable graphs

DNA graph characterization for the line digraph of dicycle with $⌊ \frac{n}{3} ⌋$ chords, $\infty$ -digraph $C_{n} \cdot C_{p}$ , and 3-blade-propeller $C_{n} \cdot C_{p} \cdot C_{q}$