Results 11 to 20 of about 588,772 (275)
International Journal of Mathematics for Industry, 2022 [Formula: see text]-labeling problem ([Formula: see text]-[Formula: see text]) is an important topic in discrete mathematics due to its various applications, like in frequency assignment in mobile communication systems, signal processing, circuit design,
Sk. Amanathulla +2 more
doaj +1 more source
Efficient enumeration of non-isomorphic interval graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2021 Recently, Yamazaki et al. provided an algorithm that enumerates all non-isomorphic interval graphs on $n$ vertices with an $O(n^4)$ time delay. In this paper, we improve their algorithm and achieve $O(n^3 \log n)$ time delay.
Patryk Mikos
doaj +1 more source
Fast Diameter Computation within Split Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2021 When can we compute the diameter of a graph in quasi linear time? We address this question for the class of {\em split graphs}, that we observe to be the hardest instances for deciding whether the diameter is at most two.
Guillaume Ducoffe +2 more
doaj +1 more source
On Edge Proper Interval-Valued Complex Fuzzy Graphs [PDF]
E3S Web of Conferences, 2023 This article summarizes about edge proper interval-valued complex fuzzy graph. Here, degree of an edge, total degree of an edge, edge proper and edge totally proper intervalvalued complex fuzzy were introduced.
Venkateshwara R., Sridevi R.
doaj +1 more source
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 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
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
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
A Characterization of Mixed Unit Interval Graphs [PDF]
, 2014 We give a complete characterization of mixed unit interval graphs, the intersection graphs of closed, open, and half-open unit intervals of the real line. This is a proper superclass of the well known unit interval graphs.
CG Lekkerkerker +9 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