Log in

Relevant bibliographies by topics / Line digraph / Journal articles

To see the other types of publications on this topic, follow the link: Line digraph.

Journal articles on the topic 'Line digraph'

Author: Grafiati

Published: 3 June 2025

Last updated: 31 July 2025

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 'Line digraph.'

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

RUAN, LU, SHITOU HAN, DEYING LI, HUNG Q. NGO, and SCOTT C. H. HUANG. "TRANSMISSION FAULT-TOLERANCE OF ITERATED LINE DIGRAPHS." Journal of Interconnection Networks 05, no. 04 (2004): 475–87. http://dx.doi.org/10.1142/s021926590400126x.

Full text

Abstract:

The main result of this paper states that, if every cyclic modification of a d-regular digraph has super line-connectivity d, then the line digraph also has super line-connectivity d. Since many well-known interconnection network topologies, such as the Kautz digraphs, the de Bruijn digraphs, etc., can be constructed by iterating the line digraph construction, our result leads to several known and new connectivity results for these topologies, as shown later in the paper.

APA, Harvard, Vancouver, ISO, and other styles

2

Begga, Ahmed, Francisco Escolano Ruiz, and Miguel Ángel Lozano. "Edge-Centric Embeddings of Digraphs: Properties and Stability Under Sparsification." Entropy 27, no. 3 (2025): 304. https://doi.org/10.3390/e27030304.

Full text

Abstract:

In this paper, we define and characterize the embedding of edges and higher-order entities in directed graphs (digraphs) and relate these embeddings to those of nodes. Our edge-centric approach consists of the following: (a) Embedding line digraphs (or their iterated versions); (b) Exploiting the rank properties of these embeddings to show that edge/path similarity can be posed as a linear combination of node similarities; (c) Solving scalability issues through digraph sparsification; (d) Evaluating the performance of these embeddings for classification and clustering. We commence by identifyi

APA, Harvard, Vancouver, ISO, and other styles

3

Solovov, A. V., and A. A. Menshikova. "Cognitive modeling of adaptive learning processes." Ontology of Designing 14, no. 2 (2024): 181–95. http://dx.doi.org/10.18287/2223-9537-2024-14-2-181-195.

Full text

Abstract:

An approach to modeling adaptive learning processes using signed and weighted directed graphs (digraphs) is exam-ined. The vertices of the digraphs represent the characteristics of educational activities. The orientation, signs, and weights of the digraph arcs define the mutual influence of these characteristics. The dynamics of adaptive learning are modeled within digraphs using a specific impulse process algorithm. An external disturbance is introduced into a partic-ular vertex of the digraph, and the propagation of this impulse is analyzed, enabling the prediction of values at other vertice

APA, Harvard, Vancouver, ISO, and other styles

4

Prayitno, Muhammad Irfan Arsyad, and Kiki Ariyanti Sugeng. "On Characteristic Polynomial of Antiadjacency Matrix of A Line Digraph." Jurnal Matematika UNAND 11, no. 1 (2022): 74. http://dx.doi.org/10.25077/jmu.11.1.74-81.2022.

Full text

Abstract:

In this paper, we find the characteristic polynomial of the antiadjacency matrix of a line digraph. There are recent studies on the relation between the characteristic polynomial of the adjacency matrix and its line digraph, we are also interested in finding the connection between the antiadjacency matrix of a digraph and its line digraph. In this paper, we show the connection of characteristic polynomial of the antiadjacency matrix between an acyclic digraph and its line digraph.

APA, Harvard, Vancouver, ISO, and other styles

5

Liu, Juan, Lin Sun, and Jixiang Meng. "A line digraph of a complete bipartite digraph." Applied Mathematics Letters 22, no. 4 (2009): 544–47. http://dx.doi.org/10.1016/j.aml.2008.04.013.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Balbuena, C., D. Ferrero, X. Marcote, and I. Pelayo. "Algebraic properties of a digraph and its line digraph." Journal of Interconnection Networks 04, no. 04 (2003): 377–93. http://dx.doi.org/10.1142/s0219265903000933.

Full text

Abstract:

Let G be a digraph, LG its line digraph and A(G) and A(LG) their adjacency matrices. We present relations between the Jordan Normal Form of these two matrices. In addition, we study the spectra of those matrices and obtain a relationship between their characteristic polynomials that allows us to relate properties of G and LG, specifically the number of cycles of a given length.

APA, Harvard, Vancouver, ISO, and other styles

7

Zhang, Fuji, and Guoning Lin. "When a digraph and its line digraph are connected and cospectral." Discrete Mathematics 184, no. 1-3 (1998): 289–95. http://dx.doi.org/10.1016/s0012-365x(97)00200-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Galeana-Sánchez, Hortensia, and L. Pastrana Ramirez. "Kernels in edge coloured line digraph." Discussiones Mathematicae Graph Theory 18, no. 1 (1998): 91. http://dx.doi.org/10.7151/dmgt.1066.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Cao, Feng, Ding-Zhu Du, Shitou Han, Dongsoo Kim, and Ting Yu. "LINE DIGRAPH ITERATIONS AND DIAMETER VULNERABILITY." Taiwanese Journal of Mathematics 3, no. 3 (1999): 281–90. http://dx.doi.org/10.11650/twjm/1500407128.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Villar, J. L. "The underlying graph of a line digraph." Discrete Applied Mathematics 37-38 (July 1992): 525–38. http://dx.doi.org/10.1016/0166-218x(92)90156-5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Imori, Masatosi, Makoto Matsumoto, and Hisao Yamada. "The line digraph of a regular and pancircular digraph is also regular and pancircular." Graphs and Combinatorics 4, no. 1 (1988): 235–39. http://dx.doi.org/10.1007/bf01864164.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Böhmova, Katherina, Cristina Dalfo, and Clemens Huemer. "New cyclic Kautz digraphs with optimal diameter." Contributions to Discrete Mathematics 16, no. 3 (2021): 111–24. http://dx.doi.org/10.55016/ojs/cdm.v16i3.62468.

Full text

Abstract:

We obtain a new family of digraphs with minimal diameter, that is, given the number of vertices and out-degree, there is no other digraph with a smaller diameter. This new family of digraphs are called `modified cyclic digraphs' $MCK(d,\ell)$, and it is derived from the Kautz digraphs $K(d,\ell)$ and from the so-called cyclic Kautz digraphs $CK(d,\ell)$. The cyclic Kautz digraphs $CK(d,\ell)$ were defined as the digraphs whose vertices are labeled by all possible sequences $a_1\ldots a_\ell$ of length $\ell$, such that each character $a_i$ is chosen from an alphabet of $d+1$ distinct symbols,

APA, Harvard, Vancouver, ISO, and other styles

13

AGUSTÍ-TORRA, ANNA, CRISTINA CERVELLÓ-PASTOR, and MIQUEL A. FIOL. "A ROUTING AND WAVELENGTH ASSIGNMENT STRATEGY FOR SUCCESSFUL TRANSMISSION IN OPTICAL NETWORKS." Journal of Interconnection Networks 10, no. 01n02 (2009): 1–26. http://dx.doi.org/10.1142/s021926590900242x.

Full text

Abstract:

Optical Burst and Packet Switching (OBS/OPS) are techniques designed to serve higher-layer packet-based communication protocols by allowing statistical multiplexing. Since OBS and OPS networks provide connectionless transport, they both suffer from contention, which occurs when multiple communications want to use simultaneously the same wavelength in a link. This paper proposes a Routing and Wavelength Assignment (RWA) strategy based on the concept of (rooted) collision-free digraph, which represents all paths assigned by the routing to those communications sharing a wavelength. Using the prop

APA, Harvard, Vancouver, ISO, and other styles

14

Severini, Simone. "On the structure of the adjacency matrix of the line digraph of a regular digraph." Discrete Applied Mathematics 154, no. 12 (2006): 1763–65. http://dx.doi.org/10.1016/j.dam.2006.03.008.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Guevara, Mucuy-kak, Camino Balbuena, and Hortensia Galeana-Sánchez. "Relation between number of kernels (and generalizations) of a digraph and its partial line digraphs." Electronic Notes in Discrete Mathematics 54 (October 2016): 265–69. http://dx.doi.org/10.1016/j.endm.2016.09.046.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

D., Parks Allen. "A Note Concerning Equipotent Digraph Homomorphism Sets." International Journal of Sciences Volume 8, no. 2019-05 (2019): 47–52. https://doi.org/10.5281/zenodo.3350701.

Full text

Abstract:

Functor adjunctions are fundamental to category theory and have recently found applications in the empirical sciences. In this paper a functor adjunction on a special full subcategory of the category of digraphs is borrowed from mathematical biology and used to equate cardinalities of sets of homomorphisms between various types of digraphs and associated line digraphs. These equalities are especially useful for regular digraphs and are applied to obtain homomorphism set cardinality equalities for the classes of de Bruijn digraphs and Kautz digraphs. Such digraphs play important roles in bioinf

APA, Harvard, Vancouver, ISO, and other styles

17

Tanaka, Yuuki, Hiroyuki Kawai, and Yukio Shibata. "Isomorphic factorization, the Kronecker product and the line digraph." Information Processing Letters 101, no. 2 (2007): 72–77. http://dx.doi.org/10.1016/j.ipl.2006.06.014.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Galeana-Sánchez, H., L. Pastrana Ramírez, and H. A. Rincón-Mejía. "Semikernels, Quasi Kernels, and Grundy Functions in the Line Digraph." SIAM Journal on Discrete Mathematics 4, no. 1 (1991): 80–83. http://dx.doi.org/10.1137/0404008.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Gimbert, Joan, and Yaokun Wu. "The underlying line digraph structure of some (0,1)-matrix equations." Discrete Applied Mathematics 116, no. 3 (2002): 289–96. http://dx.doi.org/10.1016/s0166-218x(01)00186-x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Yan, Weigen, and Fuji Zhang. "Heredity of the index of convergence of the line digraph." Discrete Applied Mathematics 131, no. 3 (2003): 681–88. http://dx.doi.org/10.1016/s0166-218x(03)00336-6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Govindan, T., and A. Muthusamy. "Nonexistence of a pair of arc disjoint directed Hamilton cycles on line digraphs of 2-diregular digraphs." Discrete Mathematics, Algorithms and Applications 07, no. 03 (2015): 1550034. http://dx.doi.org/10.1142/s1793830915500342.

Full text

Abstract:

Bermond conjectured that if G is Hamilton cycle decomposable, then L(G), the line graph of G is Hamilton cycle decomposable. In this paper, we prove that, for any k > 5, there exists a directed Hamilton cycle decomposable 2-diregular digraph D of order 2k such that L(D) is not directed Hamilton cycle decomposable.

APA, Harvard, Vancouver, ISO, and other styles

22

Hasunuma, Toru, and Yukio Shibata. "Containment of butterflies in networks constructed by the line digraph operation." Information Processing Letters 61, no. 1 (1997): 25–30. http://dx.doi.org/10.1016/s0020-0190(96)00183-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Zhang, Fuji, and Zhibo Chen. "On commutativity of two unary digraph operations: Subdividing and line-digraphing." Discrete Mathematics 306, no. 21 (2006): 2733–39. http://dx.doi.org/10.1016/j.disc.2006.04.025.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Hasunuma, Toru. "Completely independent spanning trees in the underlying graph of a line digraph." Discrete Mathematics 234, no. 1-3 (2001): 149–57. http://dx.doi.org/10.1016/s0012-365x(00)00377-0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Viswanathan, Suresh, Éva Czabarka, and Abhijit Sengupta. "On fault-tolerant embedding of Hamiltonian circuits in line digraph interconnection networks." Information Processing Letters 57, no. 5 (1996): 265–71. http://dx.doi.org/10.1016/0020-0190(96)00011-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Ding-Zhu, D., Y. D. Lyuu, and D. F. Hsu. "Line digraph iterations and connectivity analysis of de Bruijn and Kautz graphs." IEEE Transactions on Computers 42, no. 5 (1993): 612–16. http://dx.doi.org/10.1109/12.223681.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Fiol, M. A., and A. S. Llado. "The partial line digraph technique in the design of large interconnection networks." IEEE Transactions on Computers 41, no. 7 (1992): 848–57. http://dx.doi.org/10.1109/12.256453.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Roanes-Lozano, Eugenio. "A Computational Approach to Overtaking Station Track Layout Design Using Graphs: An Extension That Supports Special Turnouts—An Improved Alternative Track Layout Proposal." Algorithms 15, no. 10 (2022): 368. http://dx.doi.org/10.3390/a15100368.

Full text

Abstract:

The author recently designed, developed and implemented in Maple a package based on the use of digraphs that analyses the connectivity of an overtaking station on a double-track line. It was used to propose an alternative track layout for this kind of station, with advantages over the track layouts usually adopted. However, that package could only deal with “standard” turnouts (but neither with crossings nor with “special” turnouts, such as “single slip turnouts” or “scissors crossings”). This new article presents an improved version of the package. It uses a trick consisting in including virt

APA, Harvard, Vancouver, ISO, and other styles

29

Ding-Zhu Du, D. F. Hsu, and Yuh-Dauh Lyuu. "Corrigendum to "Line Digraph Iterations and Connectivity Analysis of de Bruijn and Kautz Graphs"." IEEE Transactions on Computers 45, no. 7 (1996): 863. http://dx.doi.org/10.1109/tc.1996.508325.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Padro, C., P. Morillo, and M. A. Fiol. "Comments on "Line digraph iterations and connectivity analysis of de Bruijn and Kautz graphs"." IEEE Transactions on Computers 45, no. 6 (1996): 768. http://dx.doi.org/10.1109/12.506435.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Ulerich, N. H., and G. J. Powers. "On-line hazard aversion and fault diagnosis in chemical processes: the digraph+fault-tree method." IEEE Transactions on Reliability 37, no. 2 (1988): 171–77. http://dx.doi.org/10.1109/24.3738.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Jiang, Guo Zhang, Jian Yi Kong, Gong Fa Li, and Liang Xi Xie. "Combining Production Planning Model of Product Line Based on Genetic Algorithm." Applied Mechanics and Materials 29-32 (August 2010): 940–46. http://dx.doi.org/10.4028/www.scientific.net/amm.29-32.940.

Full text

Abstract:

At present, iron and steel enterprise develops towards the direction with many procedure, many process, many variety and many specification, and reaches hundreds and thousands of product series and product mix, how to plan, organize and control steel production, production schedule of its product line is a key issue. Mixed production plan model of product line can be summed up in a kind of network flow plan issue. According to the characteristics of network flow plan issue, the production schedule model of product network flow is established through describing digraph-connected graph of produc

APA, Harvard, Vancouver, ISO, and other styles

33

García de la Vega, Ignacio, and Ricardo Riaza. "Saddle-Node Bifurcations in Classical and Memristive Circuits." International Journal of Bifurcation and Chaos 26, no. 04 (2016): 1650064. http://dx.doi.org/10.1142/s0218127416500644.

Full text

Abstract:

This paper addresses a systematic characterization of saddle-node bifurcations in nonlinear electrical and electronic circuits. Our approach is a circuit-theoretic one, meaning that the bifurcation is analyzed in terms of the devices’ characteristics and the graph-theoretic properties of the digraph underlying the circuit. The analysis is based on a reformulation of independent interest of the saddle-node theorem of Sotomayor for semiexplicit index one differential-algebraic equations (DAEs), which define the natural context to set up nonlinear circuit models. The bifurcation is addressed not

APA, Harvard, Vancouver, ISO, and other styles

34

Huang, Xiaoyu, Qinghuai Liang, Songsong Li, Kuo Han, and Xiangting Wei. "Research on Passenger Flow Assignment of Integrated Cross-Line and Skip-Stop Operation between State Railway and Suburban Railway." Applied Sciences 12, no. 7 (2022): 3617. http://dx.doi.org/10.3390/app12073617.

Full text

Abstract:

The passenger flow assignment in the rail transit network is the basis for determining the passenger spatiotemporal distribution and train operation organization plan. In previous studies, the passenger flow assignment problem mainly focused on lines within the same rail system. Few studies focus on lines with the integrated mode of cross-line and skip-stop operation between state and suburban railway due to fewer cases in practice. In this study, passenger congestion and fare policy are taken into account in the generalized travel cost function, and a passenger flow assignment model based on

APA, Harvard, Vancouver, ISO, and other styles

35

Dalfó, C., and M. A. Fiol. "Cospectral digraphs from locally line digraphs." Linear Algebra and its Applications 500 (July 2016): 52–62. http://dx.doi.org/10.1016/j.laa.2016.03.014.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Brunat, J. M., M. Espona, M. A. Fiol, and O. Serra. "On Cayley line digraphs." Discrete Mathematics 138, no. 1-3 (1995): 147–59. http://dx.doi.org/10.1016/0012-365x(94)00196-p.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

El Sahili, Amine. "Functions and line digraphs." Journal of Graph Theory 44, no. 4 (2003): 296–303. http://dx.doi.org/10.1002/jgt.10146.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Oladele, Matthias Omotayo, Temilola Morufat Adepoju, Olaide `. Abiodun Olatoke, and Oluwaseun Adewale Ojo. "OFFLINE YORÙBÁ HANDWRITTEN WORD RECOGNITION USING GEOMETRIC FEATURE EXTRACTION AND SUPPORT VECTOR MACHINE CLASSIFIER." MALAYSIAN JOURNAL OF COMPUTING 5, no. 2 (2020): 504. http://dx.doi.org/10.24191/mjoc.v5i2.8947.

Full text

Abstract:

Yorùbá language is one of the three main languages that is been spoken in Nigeria. It is a tonal language that carries an accent on the vowel alphabets. There are twenty-five (25) alphabets in Yorùbá language with one of the alphabets a digraph (GB). Due to the difficulty in typing handwritten Yorùbá documents, there is a need to develop a handwritten recognition system that can convert the handwritten texts to digital format. This study discusses the offline Yorùbá handwritten word recognition system (OYHWR) that recognizes Yorùbá uppercase alphabets. Handwritten characters and words were obt

APA, Harvard, Vancouver, ISO, and other styles

39

Balbuena, C., and M. Guevara. "Kernels and partial line digraphs." Applied Mathematics Letters 23, no. 10 (2010): 1218–20. http://dx.doi.org/10.1016/j.aml.2010.06.001.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Balbuena, C., C. Dalfó, and B. Martínez-Barona. "Identifying codes in line digraphs." Applied Mathematics and Computation 383 (October 2020): 125357. http://dx.doi.org/10.1016/j.amc.2020.125357.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Acharya, Mukti, and Deepa Sinha. "Characterization of signed line digraphs." Discrete Applied Mathematics 161, no. 9 (2013): 1170–72. http://dx.doi.org/10.1016/j.dam.2012.10.005.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Dalfó, C. "Iterated line digraphs are asymptotically dense." Linear Algebra and its Applications 529 (September 2017): 391–96. http://dx.doi.org/10.1016/j.laa.2017.04.036.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Prisner, Erich. "Eulerian iterated line graphs and digraphs." Discrete Mathematics 236, no. 1-3 (2001): 315–23. http://dx.doi.org/10.1016/s0012-365x(00)00450-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Padró, C., and P. Morillo. "Diameter vulnerability of iterated line digraphs." Discrete Mathematics 149, no. 1-3 (1996): 189–204. http://dx.doi.org/10.1016/0012-365x(96)83094-9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Lu, Qin, Er-fang Shan, and Min Zhao. "(k,l)-kernels in line digraphs." Journal of Shanghai University (English Edition) 10, no. 6 (2006): 484–86. http://dx.doi.org/10.1007/s11741-006-0042-5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Lichiardopol, Nicolas. "Independence number of iterated line digraphs." Discrete Mathematics 293, no. 1-3 (2005): 185–93. http://dx.doi.org/10.1016/j.disc.2004.08.030.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Liu, Xinming, and Douglas B. West. "Line digraphs and coreflexive vertex sets." Discrete Mathematics 188, no. 1-3 (1998): 269–77. http://dx.doi.org/10.1016/s0012-365x(98)00022-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Ferrero, Daniela, Thomas Kalinowski, and Sudeep Stephen. "Zero forcing in iterated line digraphs." Discrete Applied Mathematics 255 (February 2019): 198–208. http://dx.doi.org/10.1016/j.dam.2018.08.019.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Hasunuma, Toru. "Embedding iterated line digraphs in books." Networks 40, no. 2 (2002): 51–62. http://dx.doi.org/10.1002/net.10032.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Bermond, Jean-Claude, Xavier Muñoz, and Alberto Marchetti-Spaccamela. "A Broadcasting Protocol in Line Digraphs." Journal of Parallel and Distributed Computing 61, no. 8 (2001): 1013–32. http://dx.doi.org/10.1006/jpdc.2001.1737.

Full text

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!