A Method for Measuring Similarity or Distance of Molecular and Arbitrary Graphs Based on a Collection of Topological Indices
Sign Up to like & getrecommendations! Published in 2025 at "Journal of Chemometrics"
DOI: 10.1002/cem.70047
Abstract: The comparison of graphs using various types of quantitative structural similarity or distance measures has an important place in many scientific disciplines. Two of these are cheminformatics and chemical graph theory, in which the structural… read more here.
Keywords: method; similarity distance; arbitrary graphs; graphs ... See more keywords
Teaching behavior technicians to create publication-quality, single-case design graphs in graphpad prism 7.
Sign Up to like & getrecommendations! Published in 2018 at "Journal of applied behavior analysis"
DOI: 10.1002/jaba.483
Abstract: In this investigation, we (a) define the desirable features of publication-quality, single-case design graphs based on recommendations in the scholarly literature, (b) suggest GraphPad Prism as a suitable graphing program for creating graphs with those… read more here.
Keywords: graphs; quality single; publication quality; prism ... See more keywords
Comparing self-directed methods for training staff to create graphs using Graphpad Prism.
Sign Up to like & getrecommendations! Published in 2019 at "Journal of applied behavior analysis"
DOI: 10.1002/jaba.522
Abstract: An important skill for behavior analysts is creating graphs that clearly convey outcomes and conform to publication conventions. GraphPad Prism is software designed for creating scientific graphs, but no prior research has empirically evaluated training… read more here.
Keywords: graphs; graphpad prism; training staff; staff create ... See more keywords
On the Q $Q$‐Polynomial Property of Bipartite Graphs Admitting a Uniform Structure
Sign Up to like & getrecommendations! Published in 2025 at "Journal of Combinatorial Designs"
DOI: 10.1002/jcd.22011
Abstract: Let Γ denote a finite, connected graph with vertex set X . Fix x ∈ X and let ε ≥ 3 denote the eccentricity of x . For mutually distinct scalars { θ i *… read more here.
Keywords: uniform structure; graphs; bipartite graphs; adjacency matrix ... See more keywords
Creating effective interrupted time series graphs: Review and recommendations
Sign Up to like & getrecommendations! Published in 2020 at "Research Synthesis Methods"
DOI: 10.1002/jrsm.1435
Abstract: Introduction Interrupted Time Series (ITS) studies may be used to assess the impact of an interruption, such as an intervention or exposure. The data from such studies are particularly amenable to visual display and, when… read more here.
Keywords: interrupted time; graphs; creating effective; time series ... See more keywords
Getting linear time in graphs of bounded neighborhood diversity
Sign Up to like & getrecommendations! Published in 2024 at "Networks"
DOI: 10.1002/net.22232
Abstract: Parameterized complexity, introduced to efficiently solve NP‐hard problems for small values of a fixed parameter, has been recently used as a tool to speed up algorithms for tractable problems. Following this line of research, we… read more here.
Keywords: neighborhood diversity; time; linear time; graphs ... See more keywords
Symmetric graphs for equally weighted tests, with application to the Hochberg procedure.
Sign Up to like & getrecommendations! Published in 2019 at "Statistics in medicine"
DOI: 10.1002/sim.8375
Abstract: The graphical approach to multiple testing provides a convenient tool for designing, visualizing, and performing multiplicity adjustments in confirmatory clinical trials while controlling the familywise error rate. It assigns a set of weights to each… read more here.
Keywords: intersection; graphs; symmetric graphs; graphical approach ... See more keywords
Basic Pattern Graphs for the Efficient Computation of Its Number of Independent Sets
Sign Up to like & getrecommendations! Published in 2020 at "Pattern Recognition"
DOI: 10.1007/978-3-030-49076-8_6
Abstract: The problem of counting the number of independent sets of a graph G (denoted as i(G)) is a classic #P-complete problem. We present some patterns on graphs that allows us the polynomial computation of i(G).… read more here.
Keywords: graphs; computation; pattern; number independent ... See more keywords
On the packing coloring of base-3 Sierpiński graphs and H-graphs
Sign Up to like & getrecommendations! Published in 2020 at "Aequationes mathematicae"
DOI: 10.1007/s00010-020-00747-w
Abstract: For a nondecreasing sequence of integers $$S=(s_1, s_2, \ldots )$$ S = ( s 1 , s 2 , … ) an S -packing k -coloring of a graph G is a mapping from V… read more here.
Keywords: graphs; base sierpi; packing coloring; sierpi ski ... See more keywords
Quantum Ergodicity on Regular Graphs
Sign Up to like & getrecommendations! Published in 2017 at "Communications in Mathematical Physics"
DOI: 10.1007/s00220-017-2879-9
Abstract: We give three different proofs of the main result of Anantharaman and Le Masson (Duke Math J 164(4):723–765, 2015), establishing quantum ergodicity—a form of delocalization—for eigenfunctions of the laplacian on large regular graphs of fixed… read more here.
Keywords: graphs; large regular; quantum ergodicity; physics ... See more keywords
On the Stab Number of Rectangle Intersection Graphs
Sign Up to like & getrecommendations! Published in 2019 at "Theory of Computing Systems"
DOI: 10.1007/s00224-019-09936-w
Abstract: We introduce the notion of stab number and exact stab number of rectangle intersection graphs, otherwise known as graphs of boxicity at most 2. A graph G is said to be a k - stabbable… read more here.
Keywords: graphs; number; stab number; rectangle intersection ... See more keywords