A polynomial algorithm for partitioning line-graphs

Faculty Opinions recommendation of Beyond bar and line graphs: time for a new data presentation paradigm.

Faculty Opinions – Post-Publication Peer Review of the Biomedical Literature ◽

10.3410/f.725444895.793507895 ◽

2015 ◽

Author(s):

H William Schnaper

Keyword(s):

Line Graphs ◽

Data Presentation

Faculty Opinions recommendation of Beyond bar and line graphs: time for a new data presentation paradigm.

Faculty Opinions – Post-Publication Peer Review of the Biomedical Literature ◽

10.3410/f.725444895.793507178 ◽

2015 ◽

Author(s):

Tilman Sauerbruch

Keyword(s):

Line Graphs ◽

Data Presentation

A Polynomial Algorithm with Asymptotic Ratio $$\boldsymbol {2/3}$$ for the Asymmetric Maximization Version of the $$\boldsymbol m $$-PSP

Journal of Applied and Industrial Mathematics ◽

10.1134/s1990478920030059 ◽

2020 ◽

Vol 14 (3) ◽

pp. 456-469

Author(s):

A. N. Glebov ◽

S. G. Toktokhoeva

Keyword(s):

Polynomial Algorithm

A polynomial algorithm of edge-neighbor-scattering number of trees

Applied Mathematics and Computation ◽

10.1016/j.amc.2016.02.021 ◽

2016 ◽

Vol 283 ◽

pp. 1-5 ◽

Cited By ~ 1

Author(s):

Yong Liu ◽

Zongtian Wei ◽

Jiarong Shi ◽

Anchan Mai

Keyword(s):

Polynomial Algorithm

Reduction of the integer factorization complexity upper bound to the complexity of the Diffie–Hellman problem

Discrete Mathematics and Applications ◽

10.1515/dma-2021-0001 ◽

2021 ◽

Vol 31 (1) ◽

pp. 1-4

Author(s):

Mikhail A. Cherepnev

Keyword(s):

Upper Bound ◽

Polynomial Algorithm ◽

Integer Factorization ◽

Factorization Problem ◽

Diffie Hellman ◽

Integer Factorization Problem

Abstract We construct a probabilistic polynomial algorithm that solves the integer factorization problem using an oracle solving the Diffie–Hellman problem.

The properties of anti-fuzzy line graphs regular

Journal of Physics Conference Series ◽

10.1088/1742-6596/1872/1/012010 ◽

2021 ◽

Vol 1872 (1) ◽

pp. 012010

Author(s):

Y Trisanti ◽

T Nusantara

Keyword(s):

Line Graphs

On maximal energy of line graphs with given parameters

Linear Algebra and its Applications ◽

10.1016/j.laa.2021.02.011 ◽

2021 ◽

Vol 619 ◽

pp. 12-49

Author(s):

Yiting Cai ◽

Bo Zhou ◽

Mengmeng Gao

Keyword(s):

Line Graphs ◽

Maximal Energy

Curve Separation for Line Graphs in Scholarly Documents

Proceedings of the 16th ACM/IEEE-CS on Joint Conference on Digital Libraries - JCDL '16 ◽

10.1145/2910896.2925469 ◽

2016 ◽

Cited By ~ 3

Author(s):

Sagnik Ray Choudhury ◽

Shuting Wang ◽

C. Lee Giles

Keyword(s):

Line Graphs

Strongly even cycle decomposable 4-regular line graphs

European Journal of Combinatorics ◽

10.1016/j.ejc.2021.103315 ◽

2021 ◽

Vol 94 ◽

pp. 103315

Author(s):

Wenzhong Liu ◽

Jiancheng Wang ◽

Qing Cui ◽

Yan Yang

Keyword(s):

Line Graphs ◽

Regular Line

Topological invariants for the line graphs of some classes of graphs

Open Chemistry ◽

10.1515/chem-2019-0154 ◽

2019 ◽

Vol 17 (1) ◽

pp. 1483-1490

Author(s):

Xiaoqing Zhou ◽

Mustafa Habib ◽

Tariq Javeed Zia ◽

Asim Naseem ◽

Anila Hanif ◽

...

Keyword(s):

Communication Theory ◽

Chemical Reactivity ◽

Line Graph ◽

Chemical Properties ◽

Topological Invariants ◽

Line Graphs ◽

Physical And Chemical Properties ◽

Physical And Chemical ◽

Ladder Graphs ◽

And Chemical Properties

AbstractGraph theory plays important roles in the fields of electronic and electrical engineering. For example, it is critical in signal processing, networking, communication theory, and many other important topics. A topological index (TI) is a real number attached to graph networks and correlates the chemical networks with physical and chemical properties, as well as with chemical reactivity. In this paper, our aim is to compute degree-dependent TIs for the line graph of the Wheel and Ladder graphs. To perform these computations, we first computed M-polynomials and then from the M-polynomials we recovered nine degree-dependent TIs for the line graph of the Wheel and Ladder graphs.