Results 31 to 40 of about 1,814,953 (245)
GRAPH-BASED URBAN LAND USE MAPPING FROM HIGH RESOLUTION SATELLITE IMAGES [PDF]
ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences, 2012 Due to the dynamic character of urban land use (e.g. urban sprawl) there is a demand for frequent updates for monitoring, modeling, and controlling purposes.
I. Walde +3 more
doaj +1 more source
, 2009 For standard terminology and notion in graph theory we refer the reader to Harary [7]; the non-standard will be given in this paper as and when required.
Reddy, P. Siva Kota +3 more
core +1 more source
Intersection Graphs of Rays and Grounded Segments
Journal of Graph Algorithms and Applications, 2018 We consider several classes of intersection graphs of line segments in the plane and prove new equality and separation results between those classes. In particular, we show that: • intersection graphs of grounded segments and intersection graphs
Jean Cardinal +4 more
doaj +1 more source
Modular Irregular Labeling on Double-Star and Friendship Graphs
Journal of Mathematics, 2021 A modular irregular graph is a graph that admits a modular irregular labeling. A modular irregular labeling of a graph G of order n is a mapping of the set of edges of the graph to 1,2,…,k such that the weights of all vertices are different.
K. A. Sugeng +3 more
doaj +1 more source
On the Locating Chromatic Number of Barbell Shadow Path Graph
Indonesian Journal of Combinatorics, 2021 The locating-chromatic number was introduced by Chartrand in 2002. The locating chromatic number of a graph is a combined concept between the coloring and partition dimension of a graph.
A. Asmiati +2 more
doaj +1 more source
Journal of Combinatorial Theory, Series B, 1988 Let be \(G=(V,E)\) be a simple graph and its core B is defined to be the subgraph of G induced by the vertices of maximum degree. In the present paper are given conditions on B which are sufficient for G to be class 1. First is introduced an edge-queue of G which is a sequence of all edges \(e\in E(G)\) with certain properties.
Dean G. Hoffman, Christopher A. Rodger
openaire +1 more source
Smarandache-Zagreb Index on Three Graph Operators [PDF]
, 2010 Many researchers have studied several operators on a connected graph in which one make an attempt on subdivision of its edges. In this paper, we show how the Zagreb indices, a particular case of Smarandache-Zagreb index of a graph changes with these ...
Ranjini, P.S., Lokesha, V.
core +1 more source
Simpler and Unified Recognition Algorithm for Path Graphs and Directed Path Graphs [PDF]
Discrete Mathematics & Theoretical Computer ScienceA path graph is the intersection graph of paths in a tree. A directed path graph is the intersection graph of paths in a directed tree. Even if path graphs and directed path graphs are characterized very similarly, their recognition algorithms differ ...
Lorenzo Balzotti
doaj +1 more source
Testing first-order properties for subclasses of sparse graphs [PDF]
, 2013 We present a linear-time algorithm for deciding first-order (FO) properties in classes of graphs with bounded expansion, a notion recently introduced by Nešetřil and Ossona de Mendez.
Thomas, Robin +2 more
core +1 more source
Tractabilities and Intractabilities on Geometric Intersection Graphs
Algorithms, 2013 A graph is said to be an intersection graph if there is a set of objects such that each vertex corresponds to an object and two vertices are adjacent if and only if the corresponding objects have a nonempty intersection.
Ryuhei Uehara
doaj +1 more source