Results 51 to 60 of about 1,080,603 (189)
A Note on Ultrametric Spaces, Minimum Spanning Trees and the Topological Distance Algorithm
Information, 2020 We relate the definition of an ultrametric space to the topological distance algorithm—an algorithm defined in the context of peer-to-peer network applications.
Jörg Schäfer
doaj +1 more source
Graph Equation for Line Graphs and m-Step Graphs [PDF]
Graphs and Combinatorics, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Seog-Jin Kim +4 more
openaire +1 more source
GRAPH-BASED POST INCIDENT INTERNAL AUDIT METHOD OF COMPUTER EQUIPMENT [PDF]
Научно-технический вестник информационных технологий, механики и оптики, 2016 Graph-based post incident internal audit method of computer equipment is proposed. The essence of the proposed solution consists in the establishing of relationships among hard disk damps (image), RAM and network.
I. S. Pantiukhin +2 more
doaj +1 more source
The Forcing Domination Number of Hamiltonian Cubic Graphs [PDF]
, 2009 The authors presented a sequence of Hamiltonian cubic graphs whose domination numbers are sharp and in this paper we study forcing domination number for those ...
H. Abdollahzadeh Ahangar +3 more
core +1 more source
Contracting Graphs to Split Graphs and Threshold Graphs
CoRR, 2013 14 pages, 4 ...
Leizhen Cai, Chengwei Guo
openaire +3 more sources
Gain Scores, ANCOVA, and Propensity Matching Procedures for Evaluating Treatments in Education
Open Education Studies, 2020 Researchers have several options available to analyze data from interventions when participants have not been randomly allocated into conditions. Among these are the gain score, ANCOVA, and propensity matching procedures.
Wright Daniel B.
doaj +1 more source
Absolutely Harmonious Labeling of Graphs [PDF]
, 2011 In this paper, we obtain necessary conditions for a graph to be absolutely harmonious and study absolutely harmonious behavior of certain classes of ...
Lourdusamy, A., Seenivasan, M.
core +1 more source
Supereulerian Graphs and the Petersen Graph
Journal of Combinatorial Theory, Series B, 1996 A graph \(G\) is called supereulerian if \(G\) has a spanning closed trail. Using a reduction technique, which was developed by the first author [A reduction method to find spanning Eulerian subgraphs, J. Graph Theory 12, No. 1, 29-45 (1988; Zbl 0659.05073)], the authors prove that any 3-edge-connected graph with at most 10 edge cuts of size 3 either ...
Paul A. Catlin, Hong-Jian Lai
openaire +4 more sources
Independent sets of maximum weight in apple-free graphs [PDF]
, 2010 We present the first polynomial-time algorithm to solve the maximum weight independent set problem for apple-free graphs, which is a common generalization of several important classes where the problem can be solved efficiently, such as claw-free graphs,
Lozin, Vadim V. +2 more
core +1 more source
Graph equations for line graphs and total graphs
Discrete Mathematics, 1975 AbstractAll pairs (G,H) of graphs G,H satisfying L(G) = T(H) are determined. The “graph equation“ L(G)= T(H) is also solved.
Dragos M. Cvetkovic, Slobodan K. Simic
openaire +2 more sources