Results 1  10
of
118,615
A Coding Method for Efficient Subgraph Querying on Vertex and EdgeLabeled Graphs
, 2013
"... Labeled graphs are widely used to model complex data in many domains, so subgraph querying has been attracting more and more attention from researchers around the world. Unfortunately, subgraph querying is very time consuming since it involves subgraph isomorphism testing that is known to be an NPc ..."
Abstract
 Add to MetaCart
Labeled graphs are widely used to model complex data in many domains, so subgraph querying has been attracting more and more attention from researchers around the world. Unfortunately, subgraph querying is very time consuming since it involves subgraph isomorphism testing that is known to be an NP
Visualizing Graphs with Node and Edge Labels
"... Abstract. When drawing graphs whose edges and nodes contain text or graphics, such information needs to be displayed without overlaps, either as part of the initial layout or as a postprocessing step. The core problem in removing overlaps lies in retaining the structural information inherent in a l ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. When drawing graphs whose edges and nodes contain text or graphics, such information needs to be displayed without overlaps, either as part of the initial layout or as a postprocessing step. The core problem in removing overlaps lies in retaining the structural information inherent in a
Total edge Fibonacci like sequence irregular labeling
"... In this paper, we define total edge Fibonacci like sequence irregular labeling f: V (G) E(G) → {1, 2,...,K} of a graph G = (V,E) of vertices and edges of G in such a way that for any two different edges xy and x′y ′ their weights f(x) + f(xy) + f(y) and f(x′) + f(x′y′) + f(y′) are distinct Fibonacc ..."
Abstract
 Add to MetaCart
In this paper, we define total edge Fibonacci like sequence irregular labeling f: V (G) E(G) → {1, 2,...,K} of a graph G = (V,E) of vertices and edges of G in such a way that for any two different edges xy and x′y ′ their weights f(x) + f(xy) + f(y) and f(x′) + f(x′y′) + f(y′) are distinct
Edge Labeling with a Condition at Distance Two
"... f(e1) − f(e2)  ≥ k 2 λ j,k − r:<G 2~C (j, k) − dan!2n)d\ MÆa.1/)m} ∆L(G), g(G) ≤ 7 2:s7"nOq2 λ 2,1 − r2[. xt(j, k) − dOq. ..."
Abstract
 Add to MetaCart
f(e1) − f(e2)  ≥ k 2 λ j,k − r:<G 2~C (j, k) − dan!2n)d\ MÆa.1/)m} ∆L(G), g(G) ≤ 7 2:s7"nOq2 λ 2,1 − r2[. xt(j, k) − dOq.
Activityedge Centric Multilabel Classification for Mining Heterogeneous Information Networks
 Information Science, Ain Shams University, Egypt
"... Multilabel classification of heterogeneous information networks has received renewed attention in social network analysis. In this paper, we present an activityedge centric multilabel classification framework for analyzing heterogeneous information networks with three unique features. First, w ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
, we model a heterogeneous information network in terms of a collaboration graph and multiple associated activity graphs. We introduce a novel concept of vertexedge homophily in terms of both vertex labels and edge labels and transform a general collaboration graph into an activity
Number of unique Edgemagic total labelings on Path Pn
, 2014
"... Edgemagic total labeling was introduced by [2]. The number of edgemagic solutions for cycles have been explored in [1]. This sequence is mentioned in On Line Encyclopedia of Integer Sequences (OEIS) [3]. In this short note, we enumerate the number of unique edgemagic total labelings on Path Pn 1 ..."
Abstract
 Add to MetaCart
Edgemagic total labeling was introduced by [2]. The number of edgemagic solutions for cycles have been explored in [1]. This sequence is mentioned in On Line Encyclopedia of Integer Sequences (OEIS) [3]. In this short note, we enumerate the number of unique edgemagic total labelings on Path Pn 1
Enumerating super edgemagic labelings for the union of nonisomorphic graphs
"... A super edgemagic labeling of a graph G = (V,E) of order p and size q is a bijection f: V ∪E → {i}p+qi=1 such that (1) f(u)+ f(uv)+ f(v) = k ∀uv ∈ E and (2) f(V) = {i}pi=1. Furthermore, when G is a linear forest, the super edgemagic labeling of G is called strong if it has the extra property tha ..."
Abstract
 Add to MetaCart
A super edgemagic labeling of a graph G = (V,E) of order p and size q is a bijection f: V ∪E → {i}p+qi=1 such that (1) f(u)+ f(uv)+ f(v) = k ∀uv ∈ E and (2) f(V) = {i}pi=1. Furthermore, when G is a linear forest, the super edgemagic labeling of G is called strong if it has the extra property
Edge Cordial, Total Edge Cordial Labeling Of Some Ladder Type Fractal Graphs
, 2012
"... This paper deals with the concept of selfsimilarity fractals of four types of square ladder fractal with existence of Edge cordial labeling. A square graph is considered as base for square fractals which leads to construction of some of ladder type fractals. For our study each iterations and the ge ..."
Abstract
 Add to MetaCart
This paper deals with the concept of selfsimilarity fractals of four types of square ladder fractal with existence of Edge cordial labeling. A square graph is considered as base for square fractals which leads to construction of some of ladder type fractals. For our study each iterations
Results 1  10
of
118,615