Related papers: EL-labelings and canonical spanning trees for subw…
In this paper, we investigate the structural properties of trees and bipartite graphs through the lens of topological indices and combinatorial graph theory. We focus on the First and Second Hyper-Zagreb indices, $HM_1(G)$ and $HM_2(G)$,…
Fitch graphs $G=(X,E)$ are digraphs that are explained by $\{\emptyset, 1\}$-edge-labeled rooted trees $T$ with leaf set $X$: there is an arc $(x,y) \in E$ if and only if the unique path in $T$ that connects the last common ancestor…
We consider graph labelings with an assignment of odd prime numbers to the vertices. Similarly to graceful graphs, a labeling is said to be elegant if the absolute differences between the labels of adjacent vertices describe exactly the…
We present a novel edge-level ego-network encoding for learning on graphs that can boost Message Passing Graph Neural Networks (MP-GNNs) by providing additional node and edge features or extending message-passing formats. The proposed…
In this paper, we consider covering graphs obtained by lifting a tree with a loop at each vertex as a voltage graph over a cyclic group. We generalize a tool of Hell, Nishiyama, and Stacho, known as the billiard strategy, for constructing…
We consider the class of graphs for which the edge connectivity is equal to the maximum number of edge-disjoint spanning trees, and the natural generalization to matroids, where the cogirth is equal to the number of disjoint bases. We…
A prime labeling on a graph of order $m$ is an assignment of $\{ 1, 2, \ldots, m \}$ to the vertices of the graph such that each pair of adjacent vertices has coprime labels. The ladder of order $2n$ is the $2 \times n$ grid graph graph…
We give a proof for sharp estimate for the number of spanning trees using linear algebra and generalize this bound to multigraphs. In addition, we show that this bound is tight for complete graphs. In addition, we give estimates for number…
We study the existence of hamiltonian cycles in plane cubic graphs G having a facial 2-factor Q. Thus hamiltonicity in G is transformed into the existence of a (quasi) spanning tree of faces in the contraction G/Q. In particular, we study…
Keyphrase Recommendation has been a pivotal problem in advertising and e-commerce where advertisers/sellers are recommended keyphrases (search queries) to bid on to increase their sales. It is a challenging task due to the plethora of items…
A good edge-labeling (gel for short) of a graph $G$ is a function $\lambda: E(G) \to \mathbb{R}$ such that, for any ordered pair of vertices $(x, y)$ of $G$, there do not exist two distinct increasing paths from $x$ to $y$, where…
We study the {\sc Graph Relabeling Problem}--given an undirected, connected, simple graph $G = (V,E)$, two labelings $L$ and $L'$ of $G$, and label {\em flip} or {\em mutation} functions determine the complexity of transforming or evolving…
Mirror graphs were introduced by Bre\v{s}ar et al. in 2004 as an intriguing class of graphs: vertex-transitive, isometrically embeddable into hypercubes, having a strong connection with regular maps and polytope structure. In this article…
Statistical inference for exponential-family models of random graphs with dependent edges is challenging. We stress the importance of additional structure and show that additional structure facilitates statistical inference. A simple…
Trellises are crucial graphical representations of codes. While conventional trellises are well understood, the general theory of (tail-biting) trellises is still under development. Iterative decoding concretely motivates such theory. In…
We present a conceptually clear and algorithmically useful framework for parameterizing the costs of tensor network contraction. Our framework is completely general, applying to tensor networks with arbitrary bond dimensions, open legs, and…
We investigate the complexity of isomorphism relations for classes of finitely generated and n-generated computably enumerable (c.e.) algebras, presented via c.e. presentations -- that is, as quotients of term algebras over decidable sets…
We define the crossing graph of a given embedded graph (such as a road network) to be a graph with a vertex for each edge of the embedding, with two crossing graph vertices adjacent when the corresponding two edges of the embedding cross…
Boundary and edge cues are highly beneficial in improving a wide variety of vision tasks such as semantic segmentation, object recognition, stereo, and object proposal generation. Recently, the problem of edge detection has been revisited…
In this contribution we investigate several extensions of the powerset that comprise arbitrarily nested subsets, and call them superpower set. This allows the definition of graphs with possibly infinitely nested nodes. additionally we…