Results 21 to 30 of about 3,533,009 (320)

Packing Smaller Graphs into a Graph

open access: yesDiscrete Mathematics, 1989
Let G be a connected graph and \(\alpha_ m(G)\) denote the largest number of vertex-disjoint connected subgraphs \(H_ 1,H_ 2,...,H_ k\) of G each having m vertices. The authors obtain the following bounds for the m-packing number \(\alpha_ m(G)\) for a connected graph G of order n and maximum degree \(\Delta\). \[ \lceil \frac{n-m+1}{(m-1)(\Delta -1)+1}
Shin-ichi Tokunaga   +2 more
openaire   +3 more sources

Graph aggregation [PDF]

open access: yesArtificial Intelligence, 2017
Graph aggregation is the process of computing a single output graph that constitutes a good compromise between several input graphs, each provided by a different source. One needs to perform graph aggregation in a wide variety of situations, e.g., when applying a voting rule (graphs as preference orders), when consolidating conflicting views regarding ...
Endriss, Ulle, Grandi, Umberto
openaire   +10 more sources

Matrices and Graphs [PDF]

open access: yesSSRN Electronic Journal, 2005
The present article is designed to be a contribution to the chapter `Combinatorial Matrix Theory and Graphs' of the Handbook of Linear Algebra, to be published by CRC Press. The format of the handbook is to give just definitions, theorems, and examples; no proofs. In the five sections given below, we present the most im- portant notions and facts about
openaire   +6 more sources

Planar Graphs as VPG-Graphs [PDF]

open access: yesJournal of Graph Algorithms and Applications, 2013
A graph is Bk-VPG when it has an intersection representation by paths in a rectangular grid with at most k bends (turns). It is known that all planar graphs are B3-VPG and this was conjectured to be tight. We disprove this conjecture by showing that all planar graphs are B2-VPG.
Steven Chaplick, Torsten Ueckerdt
openaire   +4 more sources

Visual Analysis of Vehicle Trajectories for Determining Cross-Sectional Load Density

open access: yesTransactions on Transport Sciences, 2019
The goal of this work was to analyze the behavior of drivers on third class roads with and without horizontal lane marking. The roads have low traffic volume, and therefore a conventional short-term study would not be able to provide enough data. We used
Roman Juránek   +4 more
doaj   +1 more source

The crossing numbers of join products of paths with three graphs of order five [PDF]

open access: yesOpuscula Mathematica, 2022
The main aim of this paper is to give the crossing number of the join product \(G^\ast+P_n\) for the disconnected graph \(G^\ast\) of order five consisting of the complete graph \(K_4\) and one isolated vertex, where \(P_n\) is the path on \(n\) vertices.
Michal Staš, Mária Švecová
doaj   +1 more source

Graph equations for line graphs, total graphs, middle graphs and quasi-total graphs

open access: yesDiscrete Mathematics, 1984
Let G be a simple finite and connected graph with the vertex set V(G) and the edge set X(G). Let V'(G) be the family of all one-point subsets of V(G). Both the line graph L(G) of G and the total graph T(G) of G are standard graph theoretical concepts. The middle graph M(G) of G is the intersection graph of \(V'(G)\cup X(G)\) and the quasi-total graph P(
D. V. S Sastry, B.Syam Prasad Raju
openaire   +3 more sources

Longitudinal trajectories of pneumonia lesions and lymphocyte counts associated with disease severity among convalescent COVID-19 patients: a group-based multi-trajectory analysis

open access: yesBMC Pulmonary Medicine, 2021
Background To explore the long-term trajectories considering pneumonia volumes and lymphocyte counts with individual data in COVID-19. Methods A cohort of 257 convalescent COVID-19 patients (131 male and 126 females) were included.
Nannan Shi   +13 more
doaj   +1 more source

The analysis of the implementation of RBL-STEM learning materials in improving student’s meta-literacy ability to solve wallpaper decoration problems using local antimagic graph coloring techniques

open access: yesHeliyon, 2023
The tessellation problem is interesting to study, especially when it is associated with mathematical concepts. In this study, a graph coloring technique will be applied to solve the problem of wallpaper tessellation decoration. The main objective of this
Dafik   +4 more
doaj   +1 more source

Generation of colored graphs with isomorphism rejection [PDF]

open access: yesИзвестия Саратовского университета. Новая серия. Серия Математика. Механика. Информатика, 2021
In the article we consider graphs whose vertices or edges are colored in a given number of colors — vertex and edge colorings. The study of colorings of graphs began in the middle of the 19th century, but the main attention is paid to proper ...
Razumovsky, Peter Vladimirovich   +1 more
doaj   +1 more source

Home - About - Disclaimer - Privacy