Results 31 to 40 of about 142,988 (312)
On Generalizations of Pairwise Compatibility Graphs [PDF]
Discrete Mathematics & Theoretical Computer ScienceA graph $G$ is a pairwise compatibility graph (PCG) if there exists an edge-weighted tree and an interval $I$, such that each leaf of the tree is a vertex of the graph, and there is an edge $\{ x, y \}$ in $G$ if and only if the weight of the path in the
Tiziana Calamoneri +3 more
doaj +1 more source
Graph classes equivalent to 12-representable graphs
Discussiones Mathematicae Graph Theory12 pages, 6 figures, Corrected typos, Corrected Reference [22]
Asahi Takaoka
doaj +3 more sources
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
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
The H-Line Signed Graph of a Signed Graph [PDF]
, 2010 For standard terminology and notion in graph theory we refer the reader to Harary; the non-standard will be given in this paper as and when required.
Reddy, Siva Kota +2 more
core +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
PENERAPAN ALGORITMA WELCH-POWELL PADA PENJADWALAN MATA PELAJARAN SD
E-Jurnal Matematika, 2023 In the context of scheduling class timetables and allocating teachers to specific subjects in schools, a common issue is the occurrence of schedule conflicts.
FINATA RASTIC ANDRARI +2 more
doaj +1 more source
Total Minimal Dominating Signed Graph [PDF]
, 2010 Cartwright and Harary considered graphs in which vertices represent persons and the edges represent symmetric dyadic relations amongst persons each of which designated as being positive or negative according to whether the nature of the relationship is ...
Reddy, Siva Kota, Vijay, S.
core +1 more source
On Computing Longest Paths in Small Graph Classes [PDF]
, 2007 The longest path problem is the one that finds a longest path in a given graph. While the graph classes in which the Hamiltonian path problem can be solved efficiently are widely investigated, few graph classes are known to be solved efficiently for the ...
RYUHEI UEHARA +3 more
core +1 more source
Hamiltonian Indices of Three Classes of Graphs Obtained from Petersen Graph
Axioms, 2023 In this paper, we mainly consider the Hamiltonian indices of three classes of graphs obtained from Petersen graph, that is, the minimum integer m of m-time iterated line graph Lm(G) of these three classes of graphs such that Lm(G) is Hamiltonian. We show
Shengmei Lv, Liying Zhao
doaj +1 more source