GlobalView

Showing items 1 - 15 of 72.

Add to Quick Collection   All 72 Results

Sort:
 Add All Items to Quick Collection
Date: 2017
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.13/1355707
Description: For a vertex v of a connected graph G (V, E) and a subset S of V, the distance between v and S is defined by d(v,S)=min{... More
Reviewed: Reviewed
Date: 2016
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.13/1345586
Description: The degree-diameter problem seeks to find the maximum possible order of a graph with a given (maximum) degree and diameter. It is known that graphs attaining the maximum possible value (the Moore b... More
Reviewed: Reviewed
Date: 2016
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.13/1345845
Description: For a simple graph G = (V,E) and for a pair of vertices u, vV , we say that a vertex wV resolves u and v if the shortest path from w... More
Reviewed: Reviewed
Date: 2016
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.13/1339541
Description: A simple graph G = (V; E) admits an H-covering if every edge in E belongs to at least one subgraph of G isomorphic to a given graph H. Then the graph G is (a, d)-H-antimagic if there exists a bijectio... More
Reviewed: Reviewed
Date: 2016
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.13/1349105
Description: Temporal reasoning finds many applications in numerous fields of artificial intelligence – frameworks for representing and analyzing temporal information are therefore important. Allen’s interval alge... More
Reviewed: Reviewed
Date: 2015
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.13/1321483
Description: Graph embedding problems have gained importance in the field of interconnection networks for parallel computer architectures. Interconnection networks provide an effective mechanism for exchanging dat... More
Reviewed: Reviewed
Date: 2015
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.13/1332117
Description: This paper provides constructions of antimagic labelings of two families of graphs, namely, sequential generalized corona graphs and generalized snowflake graphs. The labelings can also be used for so... More
Reviewed: Reviewed
Date: 2015
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.13/1329993
Description: Let l: V(G) → N be a labeling of the vertices of a graph G by positive integers. Define C(u) = Σv∈N(v)l(v) + d(u), where d(u) denotes the degree of u and N(u) denotes the open neighborhood ... More
Full Text: Full Text
Reviewed: Reviewed
Image Thumbnail
Date: 2015
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.13/1335749
Description: The minimum linear arrangement problem is a combinatorial optimization problem whose goal is to find a linear layout of a network in such way that a certain objective cost function is optimized. In th... More
Reviewed: Reviewed
Date: 2015
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.13/1339654
Description: Lladó and Moragas ['Cycle-magic graphs', Discrete Math. 307 (2007), 2925-2933] showed the cyclic-magic and cyclic-supermagic behaviour of several classes of connected graphs. They discussed cyc... More
Reviewed: Reviewed
Date: 2015
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.13/1336803
Description: Eigenvalues of a graph are the eigenvalues of its adjacency matrix. The multiset of eigenvalues is called the spectrum. The energy of a graph is the sum of the absolute values of its eigenvalue... More
Reviewed: Reviewed
Date: 2015
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.13/1335973
Description: The degree/diameter problem is to determine the largest graphs of given maximum degree and given diameter. General upper bounds-called Moore bounds-for the order of such graphs are attainable only for... More
Reviewed: Reviewed
Date: 2015
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.13/1339665
Description: An almost Moore (d, k)-digraph is a regular digraph of degree d > 1, diameter k > 1 and order N(d,k)=d+d²+...+dk. So far, their existence has only been showed for k = 2. Their nonexistence ... More
Reviewed: Reviewed
Date: 2015
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.13/1332998
Description: For a graph G a bijection from the vertex set and the edge set of G to the set {1, 2, ..., |V(G)| + |E(G)|} is called a total labeling of G. The edge-weight of an edge is the sum of the label of the e... More
Full Text: Full Text
Reviewed: Reviewed
Image Thumbnail
Date: 2015
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.13/1330917
Description: A simple graph G admits an H-covering if every edge in E(G) belongs to a subgraph of G isomorphic to H. An (a, d)-H-antimagic total labeling of a graph G admitting an H-covering is a bijective functio... More
Reviewed: Reviewed