Log in

Relevant bibliographies by topics / Interval digraphs / Journal articles

To see the other types of publications on this topic, follow the link: Interval digraphs.

Journal articles on the topic 'Interval digraphs'

Author: Grafiati

Published: 18 May 2024

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Interval digraphs.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Feder, Tomás, Pavol Hell, Jing Huang, and Arash Rafiey. "Adjusted Interval Digraphs." Electronic Notes in Discrete Mathematics 32 (March 2009): 83–91. http://dx.doi.org/10.1016/j.endm.2009.02.012.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Das, S., M. Sen, A. B. Roy, and D. B. West. "Interval digraphs: An analogue of interval graphs." Journal of Graph Theory 13, no. 2 (1989): 189–202. http://dx.doi.org/10.1002/jgt.3190130206.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Prisner, Erich. "Algorithms for interval catch digraphs." Discrete Applied Mathematics 51, no. 1-2 (1994): 147–57. http://dx.doi.org/10.1016/0166-218x(94)90104-x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

West, Douglas B. "Short proofs for interval digraphs." Discrete Mathematics 178, no. 1-3 (1998): 287–92. http://dx.doi.org/10.1016/s0012-365x(97)81840-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Sen, Malay, P. Talukdar, and Sandip Das. "Chronological orderings of interval digraphs." Discrete Mathematics 306, no. 14 (2006): 1601–9. http://dx.doi.org/10.1016/j.disc.2005.11.032.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Prisner, Erich. "A characterization of interval catch digraphs." Discrete Mathematics 73, no. 3 (1989): 285–89. http://dx.doi.org/10.1016/0012-365x(89)90271-9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Das, Ashok Kumar, Sandip Das, and Malay Sen. "Forbidden substructure for interval digraphs/bigraphs." Discrete Mathematics 339, no. 2 (2016): 1028–51. http://dx.doi.org/10.1016/j.disc.2015.10.010.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Müller, Haiko. "Recognizing interval digraphs and interval bigraphs in polynomial time." Discrete Applied Mathematics 78, no. 1-3 (1997): 189–205. http://dx.doi.org/10.1016/s0166-218x(97)00027-9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Feder, Tomás, Pavol Hell, Jing Huang, and Arash Rafiey. "Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms." Discrete Applied Mathematics 160, no. 6 (2012): 697–707. http://dx.doi.org/10.1016/j.dam.2011.04.016.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Takaoka, Asahi. "A recognition algorithm for adjusted interval digraphs." Discrete Applied Mathematics 294 (May 2021): 253–56. http://dx.doi.org/10.1016/j.dam.2021.02.014.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Paul, Sanchita, and Shamik Ghosh. "On some subclasses of interval catch digraphs." Electronic Journal of Graph Theory and Applications 10, no. 1 (2022): 157. http://dx.doi.org/10.5614/ejgta.2022.10.1.10.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Hell, Pavol, and Arash Rafiey. "Monotone Proper Interval Digraphs and Min-Max Orderings." SIAM Journal on Discrete Mathematics 26, no. 4 (2012): 1576–96. http://dx.doi.org/10.1137/100783844.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Cho, Han Hyuk, and Suh-Ryung Kim. "A class of acyclic digraphs with interval competition graphs." Discrete Applied Mathematics 148, no. 2 (2005): 171–80. http://dx.doi.org/10.1016/j.dam.2005.02.005.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Meng, Deyuan, Mingjun Du, and Yingmin Jia. "Interval Bipartite Consensus of Networked Agents Associated With Signed Digraphs." IEEE Transactions on Automatic Control 61, no. 12 (2016): 3755–70. http://dx.doi.org/10.1109/tac.2016.2528539.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Pavlenko, V. A. "Number of digraphs of periodic points of a continuous mapping of an interval into itself." Ukrainian Mathematical Journal 39, no. 5 (1988): 481–86. http://dx.doi.org/10.1007/bf01066460.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Abdulla, Ugur G., Rashad U. Abdulla, Muhammad U. Abdulla, and Naveed H. Iqbal. "Second Minimal Orbits, Sharkovski Ordering and Universality in Chaos." International Journal of Bifurcation and Chaos 27, no. 05 (2017): 1730018. http://dx.doi.org/10.1142/s021812741730018x.

Full text

Abstract:

This paper introduces the notion of second minimal [Formula: see text]-periodic orbits of continuous maps on the interval according to whether [Formula: see text] is a successor of the minimal period of the map in the Sharkovski ordering. We pursue the classification of second minimal [Formula: see text]-orbits in terms of cyclic permutations and digraphs. It is proven that there are nine types of second minimal 7-orbits with accuracy up to inverses. The result is applied to the problem of the distribution of periodic windows within the chaotic regime of the bifurcation diagram of the one-para

APA, Harvard, Vancouver, ISO, and other styles

17

Talukdar, Malay Sen P., and Sandip Das. "Chronological Orderings of Interval Digraph." Electronic Notes in Discrete Mathematics 15 (May 2003): 182–85. http://dx.doi.org/10.1016/s1571-0653(04)00574-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Sen, Malay K., B. K. Sanyal, and Douglas B. West. "Representing digraphs using intervals or circular arcs." Discrete Mathematics 147, no. 1-3 (1995): 235–45. http://dx.doi.org/10.1016/0012-365x(94)00167-h.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Sanyal, Barun K., and Malay K. Sen. "New characterizations of digraphs represented by intervals." Journal of Graph Theory 22, no. 4 (1996): 297–303. http://dx.doi.org/10.1002/(sici)1097-0118(199608)22:4<297::aid-jgt3>3.0.co;2-g.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Das, Ashok Kumar, and Ritapa Chakraborty. "Graphs and digraphs represented by intervals and circular arcs." Discrete Applied Mathematics 228 (September 2017): 41–49. http://dx.doi.org/10.1016/j.dam.2016.11.004.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Tian, Gui-Xian, Ting-Zhu Huang, and Shu-Yu Cui. "The digraphs and inclusion intervals of matrix singular values." Numerical Linear Algebra with Applications 16, no. 8 (2009): 677–87. http://dx.doi.org/10.1002/nla.638.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Martins-Ferreira, Nelson. "Internal Categorical Structures and Their Applications." Mathematics 11, no. 3 (2023): 660. http://dx.doi.org/10.3390/math11030660.

Full text

Abstract:

While surveying some internal categorical structures and their applications, it is shown that triangulations and internal groupoids can be unified as two different instances of the same common structure, namely a multi-link. A brief survey includes the categories of directed graphs, reflexive graphs, links, multi-links, triangulations, trigraphs, multiplicative graphs, groupoids, pregroupoids, internal categories, kites, directed kites and multiplicative kites. Most concepts are well-known, and all of them have appeared in print at least once. For example, a multiplicative directed kite has be

APA, Harvard, Vancouver, ISO, and other styles

23

Li, Jiong-sheng, Kai Yang, and Qing-xue Wang. "Digraphs and Inclusion Intervals of Brualdi-type for Singular Values." Acta Mathematicae Applicatae Sinica, English Series 18, no. 3 (2002): 471–76. http://dx.doi.org/10.1007/s102550200047.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Das, S., and M. Sen. "An interval digraph in relation to its associated bipartite graph." Discrete Mathematics 122, no. 1-3 (1993): 113–36. http://dx.doi.org/10.1016/0012-365x(93)90290-a.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Hetmańczyk, Mariusz Piotr. "The Reliability Model of AC-Asynchronous Drive Based on the Multilevel Prognosis System Supported by Matrices and Digraphs Methods." Solid State Phenomena 199 (March 2013): 85–90. http://dx.doi.org/10.4028/www.scientific.net/ssp.199.85.

Full text

Abstract:

Author of this article presents an authorship reliability model of a AC-asynchronous drive written in accordance with assumptions of the multilevel prognosis system based on matrices and digraphs methods. Described model take advantage of knowledge gathered from specialists on the basis of their experience. It is worth to stress that parameters of the reliability model of the AC-drive meet the requirements of units utilized in case of distributed drives. Each change of its application range requires a modification of internal parameters, but the functional structure remains without any variati

APA, Harvard, Vancouver, ISO, and other styles

26

Pramanik, Tarasankar, G. Muhiuddin, Abdulaziz M. Alanazi, and Madhumangal Pal. "An Extension of Fuzzy Competition Graph and Its Uses in Manufacturing Industries." Mathematics 8, no. 6 (2020): 1008. http://dx.doi.org/10.3390/math8061008.

Full text

Abstract:

Competition graph is a graph which constitutes from a directed graph (digraph) with an edge between two vertices if they have some common preys in the digraph. Moreover, Fuzzy competition graph (briefly, FCG) is the higher extension of the crisp competition graph by assigning fuzzy value to each vertex and edge. Also, Interval-valued FCG (briefly, IVFCG) is another higher extension of fuzzy competition graph by taking each fuzzy value as a sub-interval of the interval [ 0 , 1 ] . This graph arises in many real world systems; one of them is discussed as follows: Each and every species in nature

APA, Harvard, Vancouver, ISO, and other styles

27

Pamplona, Jill Maegan B., and Imelda S. Aniversario. "On the Planarity of a Directed Pathos Total Digraphs of Some Special Arborescence Graphs." European Journal of Pure and Applied Mathematics 15, no. 3 (2022): 1331–43. http://dx.doi.org/10.29020/nybg.ejpam.v15i3.4492.

Full text

Abstract:

An arborescence graph is a directed graph in which, for a vertex u called the root, and any other vertex v, there is exactly one directed path from u to v. The directed pathos of an arborescence Ar is defined as a collection of minimum number of arc disjoint open directed paths whose union is Ar. In [6], for an arborescence Ar, a directed pathos total digraph Q = DP T(Ar)has vertex set V (Q) = V (Ar) ∪ A(Ar) ∪ P(Ar), where V (Ar) is the vertex set, A(Ar) is the arc set, and P(Ar) is a directed pathos set of Ar. The arc set A(Q) consists of the following arcs: ab such that a, b ∈ A(Ar) and the

APA, Harvard, Vancouver, ISO, and other styles

28

ABRAMS, AARON, ERIC BABSON, HENRY LANDAU, ZEPH LANDAU, and JAMES POMMERSHEIM. "Distributions of Order Patterns of Interval Maps." Combinatorics, Probability and Computing 22, no. 3 (2013): 319–41. http://dx.doi.org/10.1017/s0963548313000035.

Full text

Abstract:

A permutation σ describing the relative orders of the first n iterates of a point x under a self-map f of the interval I=[0,1] is called an order pattern. For fixed f and n, measuring the points x ∈ I (according to Lebesgue measure) that generate the order pattern σ gives a probability distribution μn(f) on the set of length n permutations. We study the distributions that arise this way for various classes of functions f.Our main results treat the class of measure-preserving functions. We obtain an exact description of the set of realizable distributions in this case: for each n this set is a

APA, Harvard, Vancouver, ISO, and other styles

29

Bountourelis, Theologos, and Spyros Reveliotis. "Optimal Node Visitation in Acyclic Stochastic Digraphs with Multi-threaded Traversals and Internal Visitation Requirements." Discrete Event Dynamic Systems 19, no. 3 (2009): 347–76. http://dx.doi.org/10.1007/s10626-009-0065-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Ceyhan, Elvan. "Domination number of an interval catch digraph family and its use for testing uniformity." Statistics 54, no. 2 (2020): 310–39. http://dx.doi.org/10.1080/02331888.2020.1720020.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Gorelov, D. Y., O. O. Ivanova, O. V. Lytvynenko, A. A. Dovbnia, and D. O. Minin. "Study of the possibilities to use keyboard handwriting for the tasks of identifying students in e-learning systems." Radiotekhnika, no. 207 (December 24, 2021): 139–48. http://dx.doi.org/10.30837/rt.2021.4.207.15.

Full text

Abstract:

When using distance education systems, the problem of information security of the educational process arises, which, in addition to external ones, also implies internal threats. One of these threats can be a legitimate user who paid a fraudster to take tests and give visibility to educational activities under his own name. The use of traditional identification methods has two significant drawbacks: firstly, the ambiguity of the identified user, because the identification of the user occurs by the entered pair login-password; secondly, the inability to detect the substitution of an identified u

APA, Harvard, Vancouver, ISO, and other styles

32

Kozerenko, Sergiy. "More on linear and metric tree maps." Opuscula Mathematica 41, no. 1 (2021): 55–70. http://dx.doi.org/10.7494/opmath.2021.41.1.55.

Full text

Abstract:

We consider linear and metric self-maps on vertex sets of finite combinatorial trees. Linear maps are maps which preserve intervals between pairs of vertices whereas metric maps are maps which do not increase distances between pairs of vertices. We obtain criteria for a given linear or a metric map to be a positive (negative) under some orientation of the edges in a tree, we characterize trees which admit maps with Markov graphs being paths and prove that the converse of any partial functional digraph is isomorphic to a Markov graph for some suitable map on a tree.

APA, Harvard, Vancouver, ISO, and other styles

33

Matsveichuk, N. M., Y. N. Sotskov, and F. Werner. "The dominance digraph as a solution to the two-machine flow-shop problem with interval processing times." Optimization 60, no. 12 (2011): 1493–517. http://dx.doi.org/10.1080/02331931003657691.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Ceyhan, Elvan. "The distribution of the relative arc density of a family of interval catch digraph based on uniform data." Metrika 75, no. 6 (2011): 761–93. http://dx.doi.org/10.1007/s00184-011-0351-y.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Marchenko, S., and O. Ivashchuk. "Control of gas transmission system in non-stationary consumption modes." Journal of Physics: Conference Series 2131, no. 4 (2021): 042003. http://dx.doi.org/10.1088/1742-6596/2131/4/042003.

Full text

Abstract:

Abstract The article deals with the issues of modeling and control of the gas transmission system in non-stationary consumption modes. The topology of the gas transmission network is parameterized in the form of a digraph, with weighted vertices representing the vertices-the drains of consumers, the vertices-the sources of suppliers, transit vertices (compressor or gas distribution stations) and arcs indicating the main parameters that affect the throughput of the system. A hierarchical model of gas transportation system management is proposed, where the upper level is the flow diagram of gas

APA, Harvard, Vancouver, ISO, and other styles

36

Boesch, F. T., A. Satyanarayana, and C. L. Suffel. "Some Alternate Characterizations of Reliability Domination." Probability in the Engineering and Informational Sciences 4, no. 2 (1990): 257–76. http://dx.doi.org/10.1017/s0269964800001571.

Full text

Abstract:

An important problem in reliability theory is to determine the reliability of a system from the reliability of its components. If E is a finite set of components, then certain subsets of E are prescribed to be the operating states of the system. A formation is any collection F of minimal operating states whose union is E. Reliability domination is defined as the total number of odd cardinality formations minus the total number of even cardinality formations. The purpose of this paper is to establish some new results concerning reliability domination. In the special case where the system can be

APA, Harvard, Vancouver, ISO, and other styles

37

Kusumastuti, Nilamsari, Raventino, and Fransiskus Fran. "The diachromatic number of double star graph." Journal of Physics: Conference Series 2106, no. 1 (2021): 012024. http://dx.doi.org/10.1088/1742-6596/2106/1/012024.

Full text

Abstract:

Abstract We are interested in the extension for the concept of complete colouring for oriented graph G → that has been proposed in many different notions by several authors (Edwards, Sopena, and Araujo-Pardo in 2013, 2014, and 2018, respectively). An oriented colouring is complete if for every ordered pair of colours, at least one arc in G → whose endpoints are coloured with these colours. The diachromatic number, dac ( G → ) , is the greatest number of colours in a complete oriented colouring. In this paper, we establish the formula of diachromatic numbers for double star graph, k 1 , n , n →

APA, Harvard, Vancouver, ISO, and other styles

38

Masrofah, Masrofah, Lolyana Lolyana, Destiani Destiani, and Erni Mustakim. "ANALISIS FAKTOR KESULITAN MEMBACA PESERTA DIDIK DI KELAS RENDAH." Jurnal Kata : Bahasa, Sastra, dan Pembelajarannya 11, no. 1 (2023): 56–65. http://dx.doi.org/10.23960/kata/v11i1.2023.07.

Full text

Abstract:

The issue in this research is that students cannot read, which makes it difficult for teachers to facilitate learning. This study thus intends to investigate and describe the reading-difficulty factors affecting SD Negeri 8 Metro Timur students in lower grades. This research employed a qualitative approach. While students, teachers, and parents of students provided the study's data sources, the study's participants were SD Negeri 8 Metro Timur students in lower grades. In this study, observation, interviews, and documentation were used to collect data. The results of this study indicate that t

APA, Harvard, Vancouver, ISO, and other styles

39

Zhilyakova, Liudmila. "Single-Threshold Model Resource Network and Its Double-Threshold Modifications." Mathematics 9, no. 12 (2021): 1444. http://dx.doi.org/10.3390/math9121444.

Full text

Abstract:

A resource network is a non-classical flow model where the infinitely divisible resource is iteratively distributed among the vertices of a weighted digraph. The model operates in discrete time. The weights of the edges denote their throughputs. The basic model, a standard resource network, has one general characteristic of resource amount—the network threshold value. This value depends on graph topology and weights of edges. This paper briefly outlines the main characteristics of standard resource networks and describes two its modifications. In both non-standard models, the changes concern t

APA, Harvard, Vancouver, ISO, and other styles

40

Yandybaeva, Natalya V. "Dynamic model for predicting quality of life indicators in the region." Journal Of Applied Informatics 18, no. 1 (2023): 129–43. http://dx.doi.org/10.37791/2687-0649-2023-18-1-129-143.

Full text

Abstract:

An approach to assessing and forecasting indicators of the quality of life of the population in the region based on the concept of system dynamics is presented. A mathematical model has been developed, which is a system of non-linear, non-homogeneous, different-tempo differential equations, which include system variables and external factors. A digraph of causal relationships between system variables and external factors is constructed. As system variables, the model uses indicators of socio-economic development of the region: gross regional product, life expectancy at birth, population size,

APA, Harvard, Vancouver, ISO, and other styles

41

Annela, Ayu, and Safran Safran. "Analysis of Early Reading Difficulties for Elementary School Students." Scaffolding: Jurnal Pendidikan Islam dan Multikulturalisme 5, no. 2 (2023): 466–84. http://dx.doi.org/10.37680/scaffolding.v5i2.3121.

Full text

Abstract:

This study aims to identify and define the beginning reading teaching and learning process. Some factors contributed to students’ first reading challenges and the teacher's strategies for overcoming those issues in grade II SDN 10 Koto Balingka. Eleven children with reading difficulties were identified as part of the study data gathered during the initial observation of the teaching and learning process in the classroom. In the 2023–2024 school year, it was known that several children had trouble starting to read in the second grade of SDN 10 Koto Balingka. This paper utilized a case study met

APA, Harvard, Vancouver, ISO, and other styles

42

Krivonosov, M. I., A. V. Varekhina, K. V. Anokhin, and M. V. Ivanchenko. "Associations of neuro-glial network calcium activity with mice movements <i>in vivo</i>." Genes & Cells 18, no. 4 (2023): 850–53. http://dx.doi.org/10.17816/gc623434.

Full text

Abstract:

Calcium imaging of nerve activity in the mouse hippocampus provides insights into cell-to-cell interactions [1]. Over time, fluctuations in cellular calcium levels encode distinct brain states during mouse brain imaging. Although synapses connect cells and transmit information, it is challenging to detect the spatiotemporal transmission pathway via calcium imaging of multiple cells due to the complexity of the spatial structure and imaging in a separate focal plane [2]. Reconstruction of the dynamic graph of connections between cells was proposed to overcome this problem. A dynamic graph compr

APA, Harvard, Vancouver, ISO, and other styles

43

Benali, Akli, Nuno Guiomar, Hugo Gonçalves, et al. "The Portuguese Large Wildfire Spread database (PT-FireSprd)." Earth System Science Data 15, no. 8 (2023): 3791–818. http://dx.doi.org/10.5194/essd-15-3791-2023.

Full text

Abstract:

Abstract. Wildfire behaviour depends on complex interactions between fuels, topography, and weather over a wide range of scales, being important for fire research and management applications. To allow for significant progress towards better fire management, the operational and research communities require detailed open data on observed wildfire behaviour. Here, we present the Portuguese Large Wildfire Spread database (PT-FireSprd) that includes the reconstruction of the spread of 80 large wildfires that occurred in Portugal between 2015 and 2021. It includes a detailed set of fire behaviour de

APA, Harvard, Vancouver, ISO, and other styles

44

Boychuk, V., A. Boychuk, M. Boychuk, and O. Burdyug. "THE ACTION SEQUENCE FORMING METHOD FOR INTELLECTUAL AGENTS." Collection of scientific works of the Military Institute of Kyiv National Taras Shevchenko University, no. 66 (2019): 65–74. http://dx.doi.org/10.17721/2519-481x/2020/66-07.

Full text

Abstract:

The article proposes an approach where the implementation of the formation of sequences of actions of intelligent agents is carried out by analogy with the activities of biological organisms using the mechanism of emotions to dynamically tune the body to perform actions. Thus, the functions of the limbic system are simulated in the organization of movements based on motivational behavior. When planning, first of all, the general condition of the agent is determined. Using the resulting state, a sequence of actions is formed. This approach will make it possible to dynamically reconfigure the se

APA, Harvard, Vancouver, ISO, and other styles

45

Petrushenko, N. "Spatio-temporal combinatorics of resource flows conservation and reduction of risks in conditions of uncertainty of the external environment." System technologies 1, no. 138 (2022): 65–78. http://dx.doi.org/10.34185/1562-9945-1-138-2022-06.

Full text

Abstract:

Management of non-structured and weakly structured systems for the impacts of the dy-namic changes is not have a developed methodological basis. Management decisions are made on the basis of stochastic recommendations based on the results of existing experience with ex-trapolation to future trends without taking into account risks and possible faults. It is not neces-sary to introduce a great lack of value and inadequacy of acceptance of solutions, related to a wide range of criteria for assessments, without a wide range of factors, and highly direct indicators. When modeling management in the

APA, Harvard, Vancouver, ISO, and other styles

46

Das, Sandip, Mathew Francis, Pavol Hell, and Jing Huang. "Recognition and Characterization of Chronological Interval Digraphs." Electronic Journal of Combinatorics 20, no. 3 (2013). http://dx.doi.org/10.37236/2497.

Full text

Abstract:

Interval graphs admit elegant structural characterizations and linear time recognition algorithms; on the other hand, the usual interval digraphs lack a forbidden structure characterization as well as a low-degree polynomial time recognition algorithm. In this paper we identify another natural digraph analogue of interval graphs that we call ”chronological interval digraphs”. By contrast, the new class admits both a forbidden structure characterization and a linear time recognition algorithm. Chronological interval digraphs arise by interpreting the standard definition of an interval graph wit

APA, Harvard, Vancouver, ISO, and other styles

47

Seifter, Norbert, and Vladimir I. Trofimov. "Reachability Relations and the Structure of Transitive Digraphs." Electronic Journal of Combinatorics 16, no. 1 (2009). http://dx.doi.org/10.37236/115.

Full text

Abstract:

In this paper we investigate reachability relations on the vertices of digraphs. If $W$ is a walk in a digraph $D$, then the height of $W$ is equal to the number of edges traversed in the direction coinciding with their orientation, minus the number of edges traversed opposite to their orientation. Two vertices $u,v\in V(D)$ are $R_{a,b}$-related if there exists a walk of height $0$ between $u$ and $v$ such that the height of every subwalk of $W$, starting at $u$, is contained in the interval $[a,b]$, where $a$ ia a non-positive integer or $a=-\infty$ and $b$ is a non-negative integer or $b=\i

APA, Harvard, Vancouver, ISO, and other styles

48

Austhof, Bethany, Patrick Bennett, and Nick Christo. "The Set of Ratios of Derangements to Permutations in Digraphs is Dense in $[0,1/2]$." Electronic Journal of Combinatorics 29, no. 1 (2022). http://dx.doi.org/10.37236/10293.

Full text

Abstract:

A permutation in a digraph $G=(V, E)$ is a bijection $f:V \rightarrow V$ such that for all $v \in V$ we either have that $f$ fixes $v$ or $(v, f(v)) \in E$. A derangement in $G$ is a permutation that does not fix any vertex. Bucic, Devlin, Hendon, Horne and Lund proved that in any digraph, the ratio of derangements to permutations is at most $1/2$. Answering a question posed by Bucic, Devlin, Hendon, Horne and Lund, we show that the set of possible ratios of derangements to permutations in digraphs is dense in the interval $[0, 1/2]$.

APA, Harvard, Vancouver, ISO, and other styles

49

Francis, Mathew C., Pavol Hell, and Dalu Jacob. "On the Kernel and Related Problems in Interval Digraphs." Algorithmica, July 19, 2022. http://dx.doi.org/10.1007/s00453-022-01010-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Meyerowitz, Aaron. "Tiling the Line with Triples." Discrete Mathematics & Theoretical Computer Science DMTCS Proceedings vol. AA,..., Proceedings (2001). http://dx.doi.org/10.46298/dmtcs.2282.

Full text

Abstract:

International audience It is known the one dimensional prototile $0,a,a+b$ and its reflection $0,b,a+b$ always tile some interval. The subject has not received a great deal of further attention, although many interesting questions exist. All the information about tilings can be encoded in a finite digraph $D_{ab}$. We present several results about cycles and other structures in this graph. A number of conjectures and open problems are given.In [Go] an elegant proof by contradiction shows that a greedy algorithm will produce an interval tiling. We show that the process of converting to a direct

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!