Related papers: Weak harmonic labeling of graphs and multigraphs
The rapid growth in feature dimension may introduce implicit associations between features and labels in multi-label datasets, making the relationships between features and labels increasingly complex. Moreover, existing methods often adopt…
We consider weighted tiling systems to represent functions from graphs to a commutative semiring such as the Natural semiring or the Tropical semiring. The system labels the nodes of a graph by its states, and checks if the neighbourhood of…
Frank Harary introduced the concepts of sum and integral sum graphs. A graph $G$ is a \textit{sum graph} if the vertices of $G$ can be labeled with distinct positive integers so that $e = uv$ is an edge of $G$ if and only if the sum of the…
In this paper, motivated by a question posed in \cite{AH}, we introduce strongly biconvex graphs as a subclass of weakly chordal and bipartite graphs. We give a linear time algorithm to find an induced matching for such graphs and we prove…
We study a geometrical condition (PHWC) which is weaker than horizontal weak conformality. In particular, we show that harmonic maps satisfying this condition, which will be called {\em pseudoharmonic morphisms}, include harmonic morphisms…
An \emph{adjacency labeling scheme} for a given class of graphs is an algorithm that for every graph $G$ from the class, assigns bit strings (labels) to vertices of $G$ so that for any two vertices $u,v$, whether $u$ and $v$ are adjacent…
The \emph{Antimagic Graph Conjecture} asserts that every connected graph $G = (V, E)$ except $K_2$ admits an edge labeling such that each label $1, 2, ..., |E|$ is used exactly once and the sums of the labels on all edges incident with a…
Few/Zero-shot learning is a big challenge of many classifications tasks, where a classifier is required to recognise instances of classes that have very few or even no training samples. It becomes more difficult in multi-label…
This paper studies planar drawings of graphs in which each vertex is represented as a point along a sequence of horizontal lines, called levels, and each edge is either a horizontal segment or a strictly $y$-monotone curve. A graph is…
A weak and a strong concept of plurifinely plurisubharmonic and plurifinely holomorphic functions are introduced. Strong will imply weak. The weak concept is studied further. A function f is weakly plurifinely plurisubharmonic if and only…
We introduce Integrated Weak Learning, a principled framework that integrates weak supervision into the training process of machine learning models. Our approach jointly trains the end-model and a label model that aggregates multiple…
The thickness $\theta(G)$ of a graph $G$ is the minimum number of planar spanning subgraphs into which the graph $G$ can be decomposed. As a topological invariant of a graph, it is a measurement of the closeness to planarity of a graph, and…
A graph is a split graph if its vertex set can be partitioned into a clique and a stable set. A split graph is unbalanced if there exist two such partitions that are distinct. Cheng, Collins and Trenk (2016), discovered the following…
One deals with r-regular bipartite graphs with 2n vertices. In a previous paper Butera, Pernici, and the author have introduced a quantity d(i), a function of the number of i-matchings, and conjectured that as n goes to infinity the…
The concept of graceful labels was proposed by Rosa, scholars began to study graceful labels of various graphs and obtained relevant results.Let the graph is a bipartite graceful graph, we have proved some graphs are graceful labeling in…
In this paper we give a formula for the $K$-theory of the $C^*$-algebra of a weakly left-resolving labelled space. This is done by realising the $C^*$-algebra of a weakly left-resolving labelled space as the Cuntz-Pimsner algebra of a…
An adjacency labeling scheme is a method that assigns labels to the vertices of a graph such that adjacency between vertices can be inferred directly from the assigned label, without using a centralized data structure. We devise adjacency…
One of the major results of [N. Robertson and P. D. Seymour. Graph minors. XIII. The disjoint paths problem. J. Combin. Theory Ser. B, 63(1):65--110, 1995], also known as the weak structure theorem, revealed the local structure of graphs…
Unlabeled multigraphs have diverse applications across scientific fields, from transportation and social networks to polymer physics. In particular, multigraphs are essential for studying the relationship between the spatial organization…
In 2006 Qian [J. Qian, Degree complete graphs; Discrete Mathematics 306 (2006), 533--537] introduced the concept of degree complete graphs for labeled graphs. He also gave a characterization of these graphs in terms of two forbidden…