Results 31 to 40 of about 848,049 (294)
Broader families of cordial graphs
Indonesian Journal of Combinatorics, 2021 A binary labeling of the vertices of a graph G is cordial if the number of vertices labeled 0 and the number of vertices labeled 1 differ by at most 1, and the number of edges of weight 0 and the number of edges of weight 1 differ by at most 1.
Christian Barrientos, Sarah Minion
doaj +1 more source
Fully decomposable split graphs [PDF]
European Journal of Combinatorics, 2009 We discuss various questions around partitioning a split graph into connected parts. Our main result is a polynomial time algorithm that decides whether a given split graph is fully decomposable, that is, whether it can be partitioned into connected parts of orders a1,a2,…,ak for every a1,a2,…,ak summing up to the order of the graph.
Hajo Broersma +2 more
openaire +6 more sources
On the Complexity of Vertex-Splitting Into an Interval Graph ⋆
Vertex splitting is a graph modification operation in which a vertex is replaced by multiple vertices such that the union of their neighborhoods equals the neighborhood of the original vertex.
Abu-Khzam, Faisal N. +3 more
core +5 more sources
Split graphs and Nordhaus–Gaddum graphs
Discrete Mathematics, 2016 A graph G is an NG-graph if χ(G) + χ(G complement) = |V(G)| + 1. We characterize NG-graphs solely from degree sequences leading to a linear-time recognition algorithm. We also explore the connections between NG-graphs and split graphs. There are three types of NG-graphs and split graphs can also be divided naturally into two categories, balanced and ...
Christine T. Cheng +2 more
openaire +3 more sources
AYNEXT - tools for streamlining the evaluation of link prediction techniques
SoftwareX, 2023 AYNEXT is an open source Python suite aimed towards researchers in the field of link prediction in Knowledge Graphs. Link prediction consists of predicting missing edges in a Knowledge Graph, which usually involves the application of different techniques
Fernando Sola +5 more
doaj +1 more source
Theoretical Computer Science, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
MONTI, Angelo, SINAIMERI, BLERINA
openaire +5 more sources
Electronic Notes in Discrete Mathematics, 2001 Abstract Abstract We prove that in a chordal graph the maximum number of independent (i.e., disjoint and nonadjacent) K r 's equals the minumum number of cliques that meet all K r 's. When r = 1, this implies that chordal graphs are perfect. When r = 2, it contains a well known forbidden subgraph characterization of split graphs.
Pavol Hell +3 more
openaire +1 more source
Decomposing Split Graphs into Locally Irregular Graphs [PDF]
Electronic Notes in Theoretical Computer Science, 2019 A graph is locally irregular if any pair of adjacent vertices have distinct degrees. A locally irregular decomposition of a graph $G$ is a decomposition $\mathcal{D}$ of $G$ such that every subgraph $H \in \mathcal{D}$ is locally irregular. A graph is said to be decomposable if it admits a locally irregular decomposition. We prove that any decomposable
Carla Negri Lintzmayer +2 more
openaire +4 more sources
On the Line Degree Splitting Graph of a Graph
, 2017 In this paper, we introduce the concept of the line degree splitting graph of a graph. We obtain some properties of this graph. We find the girth of the line degree splitting graphs.
B. Basavanagoud, Roopa S. Kusugal
core +1 more source
On the Families of Graphs With Unbounded Metric Dimension
IEEE Access, 2019 A family G of connected graphs is a family with unbounded metric dimension if dim(G) is not constant and depends on the order of graph. In this paper, we compute the metric dimension of the splitting graphs S(Pn) and S(Cn) of a path and cycle.
Heng Pan +4 more
doaj +1 more source