Results 21 to 30 of about 157,845 (305)
Spanning connectedness and Hamiltonian thickness of graphs and interval graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 A spanning connectedness property is one which involves the robust existence of a spanning subgraph which is of some special form, say a Hamiltonian cycle in which a sequence of vertices appear in an arbitrarily given ordering, or a Hamiltonian path in ...
Peng Li, Yaokun Wu
doaj +1 more source
Interval-valued bipolar fuzzy line graphs
BMC Research Notes, 2023 Objectives The notion of Bipolarity based on positive and negative outcomes. It is well known that bipolar models give more precision, flexibility, and compatibility to the system as compared to the classical models and fuzzy models.
Keneni Abera Tola +2 more
doaj +1 more source
Interval Valued Intuitionistic Fuzzy Line Graphs
BMC Research Notes, 2022 Objectives In the field of graph theory, an intuitionistic fuzzy set becomes a useful tool to handle problems related to uncertainty and impreciseness. We introduced the interval-valued intuitionistic fuzzy line graphs (IVIFLG) and explored the results ...
V. N. Srinivasa Rao Repalle +2 more
doaj +1 more source
On the enumeration of interval graphs [PDF]
Proceedings of the American Mathematical Society, Series B, 2017 We present upper and lower bounds for the number i n i_n
Yang, Joyce C., Pippenger, Nicholas
openaire +3 more sources
FO Model Checking of Interval Graphs [PDF]
Logical Methods in Computer Science, 2015 We study the computational complexity of the FO model checking problem on interval graphs, i.e., intersection graphs of intervals on the real line. The main positive result is that FO model checking and successor-invariant FO model checking can be solved
Robert Ganian +5 more
doaj +1 more source
On the Cubicity of Interval Graphs
Graphs and Combinatorics, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chandran, L Sunil +2 more
openaire +1 more source
Large-girth roots of graphs [PDF]
, 2010 We study the problem of recognizing graph powers and computing roots of graphs. Our focus is on classes of graphs with no short cycles. We provide a polynomial time recognition algorithm for r-th powers of graphs of girth at least 2r vertical bar 3, thus
Adamaszek, Michal +4 more
core +1 more source
Closed graphs are proper interval graphs
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2014 Let G be a connected simple graph. We prove that G is a closed graph if and only if G is a proper interval graph. As a consequence we obtain that there exist linear-time algorithms for closed graph recognition.
Crupi Marilena, Rinaldo Giancarlo
doaj +1 more source
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
Coloring problem of signed interval graphs [PDF]
Transactions on Combinatorics, 2019 A signed graph $(G,\sigma)$ is a graph together with an assignment of signs $\{+,-\}$ to its edges where $\sigma$ is the subset of its negative edges.
Farzaneh Ramezani
doaj +1 more source