Results 41 to 50 of about 3,337,855 (342)
AKCE International Journal of Graphs and Combinatorics, 2020 Let be a graph of order . A numbering of is a labeling that assigns distinct elements of the set to the vertices of , where each edge of is labeled .
Rikio Ichishima +2 more
doaj +1 more source
Equistable graphs, general partition graphs, triangle graphs, and graph products
Discrete Applied Mathematics, 2011 AbstractIn this paper we examine the connections between equistable graphs, general partition graphs and triangle graphs. While every general partition graph is equistable and every equistable graph is a triangle graph, not every triangle graph is equistable, and a conjecture due to Jim Orlin states that every equistable graph is a general partition ...
Martin Milanič, Štefko Miklavič
openaire +2 more sources
On the strong beta-number of galaxies with three and four components
AKCE International Journal of Graphs and Combinatorics, 2020 The beta-number of a graph is the smallest positive integer for which there exists an injective function such that each is labeled and the resulting set of edge labels is for some positive integer . The beta-number of is if there exists no such integer .
Rikio Ichishima +2 more
doaj +1 more source
On sub-class sizes of mutually permutable products
Open Mathematics, 2021 In this paper, we investigate the influence of sub-class sizes on a mutually permutable factorized group in which the sub-class sizes of some elements of its factors have certain quantitative properties. Some criteria for a group to be pp-nilpotent or pp-
Li Jinbao, Yang Yong
doaj +1 more source
Indivisibility for Classes of Graphs [PDF]
arXiv, 2023 We examine indivisibility for classes of graphs. We show that the class of hereditarily $\alpha$-sparse graphs is indivisible if and only if $\alpha > 2$. Additionally, we show that the following classes of graphs are indivisible: perfect graphs, cographs, and chordal graphs, and the following classes of graphs are not indivisible: threshold graphs ...
arxiv
Recolouring planar graphs of girth at least five [PDF]
arXiv, 2021 For a positive integer $k$, the $k$-recolouring graph of a graph $G$ has as vertex set all proper $k$-colourings of $G$ with two $k$-colourings being adjacent if they differ by the colour of exactly one vertex. A result of Dyer et al. regarding graphs of bounded degeneracy implies that the $7$-recolouring graphs of planar graphs, the $5$-recolouring ...
arxiv
Graphs whose line graphs are ring graphs [PDF]
AKCE International Journal of Graphs and Combinatorics, 2020 Given a graph H, a path of length at least two is called an H-path if meets H exactly in its ends. A graph G is a ring graph if each block of G which is not a bridge or a vertex can be constructed inductively by starting from a single cycle and then in each step adding an H-path that meets graph H in the previous step in two adjacent vertices.
openaire +3 more sources
BMC BioinformaticsMotivation The prediction of cancer drug response is a challenging subject in modern personalized cancer therapy due to the uncertainty of drug efficacy and the heterogeneity of patients.
Chuanqi Lao +5 more
doaj +1 more source
An Inclusive Distance Irregularity Strength of n-ary Tree
JTAM (Jurnal Teori dan Aplikasi Matematika)An inclusive distance vertex irregular labelling of a simple graph G is a function of the vertex set of to positive integer set such that the sum of its vertex label and the labels of all vertices adjacent to the vertex are distinct.
Kristiana Wijaya +3 more
doaj +1 more source
Teaching and Learning Strategies for First-year Medical Students [PDF]
Journal of Clinical and Diagnostic ResearchWe read with great interest the article “Graph Constructors Versus Graph Interpreters Versus Non Graphers: A Search towards Better Cognitive Performers in Biochemistry among First-Year Medical Undergraduates,” published by Gunanithi K et al., in the July
Sarita Anil Shinde, Umesh K More
doaj +1 more source